./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:12:16,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:12:16,862 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:12:16,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:12:16,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:12:16,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:12:16,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:12:16,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:12:16,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:12:16,890 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:12:16,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:12:16,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:12:16,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:12:16,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:12:16,893 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:12:16,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:12:16,894 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:12:16,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:12:16,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:12:16,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:12:16,897 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:12:16,897 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:12:16,898 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:12:16,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:12:16,899 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:12:16,899 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:12:16,900 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:12:16,900 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:12:16,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:12:16,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:12:16,902 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:12:16,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:12:16,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:12:16,903 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:12:16,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:12:16,903 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:12:16,903 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:12:16,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:12:16,904 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:12:16,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:12:16,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:12:16,904 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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2023-11-29 02:12:17,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:12:17,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:12:17,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:12:17,138 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:12:17,138 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:12:17,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2023-11-29 02:12:20,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:12:20,356 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:12:20,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2023-11-29 02:12:20,378 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data/0e3946906/e64ed953ba4844fe9167a1535b9fb235/FLAG41830a4fa [2023-11-29 02:12:20,395 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data/0e3946906/e64ed953ba4844fe9167a1535b9fb235 [2023-11-29 02:12:20,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:12:20,399 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:12:20,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:12:20,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:12:20,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:12:20,408 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:12:20" (1/1) ... [2023-11-29 02:12:20,409 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668d90d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:20, skipping insertion in model container [2023-11-29 02:12:20,410 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:12:20" (1/1) ... [2023-11-29 02:12:20,478 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:12:21,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:12:21,110 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 02:12:21,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5abe4d21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:21, skipping insertion in model container [2023-11-29 02:12:21,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:12:21,112 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:12:21,114 INFO L158 Benchmark]: Toolchain (without parser) took 713.53ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 104.7MB in the end (delta: 22.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 02:12:21,114 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:12:21,115 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.66ms. Allocated memory is still 159.4MB. Free memory was 126.4MB in the beginning and 104.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:12:21,117 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.19ms. Allocated memory is still 115.3MB. Free memory is still 75.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.66ms. Allocated memory is still 159.4MB. Free memory was 126.4MB in the beginning and 104.7MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 740]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:12:23,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:12:23,087 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:12:23,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:12:23,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:12:23,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:12:23,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:12:23,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:12:23,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:12:23,138 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:12:23,139 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:12:23,139 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:12:23,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:12:23,141 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:12:23,142 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:12:23,142 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:12:23,143 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:12:23,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:12:23,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:12:23,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:12:23,145 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:12:23,147 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:12:23,148 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:12:23,148 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:12:23,148 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:12:23,149 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:12:23,149 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:12:23,149 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:12:23,150 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:12:23,150 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:12:23,150 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:12:23,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:12:23,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:12:23,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:12:23,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:12:23,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:12:23,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:12:23,153 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:12:23,153 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:12:23,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:12:23,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:12:23,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:12:23,154 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:12:23,154 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:12:23,154 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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 -> 87dd09ebbd7004650762949ef44f5f810b259dfe76e04f61193dc727167eb435 [2023-11-29 02:12:23,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:12:23,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:12:23,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:12:23,521 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:12:23,521 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:12:23,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2023-11-29 02:12:26,395 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:12:26,726 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:12:26,727 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-3.i [2023-11-29 02:12:26,748 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data/0dc3c0031/1afd45d9b5c44addb039f3ddab8b1cac/FLAGd8e71b9cf [2023-11-29 02:12:26,765 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/data/0dc3c0031/1afd45d9b5c44addb039f3ddab8b1cac [2023-11-29 02:12:26,768 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:12:26,770 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:12:26,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:12:26,772 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:12:26,778 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:12:26,779 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:12:26" (1/1) ... [2023-11-29 02:12:26,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26802840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:26, skipping insertion in model container [2023-11-29 02:12:26,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:12:26" (1/1) ... [2023-11-29 02:12:26,864 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:12:27,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:12:27,545 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:12:27,561 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:12:27,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:12:27,664 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:12:27,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:12:27,804 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:12:27,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27 WrapperNode [2023-11-29 02:12:27,805 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:12:27,806 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:12:27,806 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:12:27,806 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:12:27,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:27,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:27,921 INFO L138 Inliner]: procedures = 180, calls = 439, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1449 [2023-11-29 02:12:27,922 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:12:27,922 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:12:27,922 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:12:27,923 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:12:27,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:27,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:27,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,135 INFO L175 MemorySlicer]: Split 413 memory accesses to 4 slices as follows [2, 401, 5, 5]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 100 writes are split as follows [0, 98, 1, 1]. [2023-11-29 02:12:28,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,136 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,214 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,235 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:12:28,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:12:28,258 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:12:28,258 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:12:28,259 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (1/1) ... [2023-11-29 02:12:28,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:12:28,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:12:28,291 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:12:28,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:12:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:12:28,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:12:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:12:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 02:12:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:12:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:12:28,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:12:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 02:12:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:12:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:12:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:12:28,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 02:12:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:12:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:12:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:12:28,340 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 02:12:28,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:12:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:12:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:12:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:12:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:12:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:12:28,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:12:28,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:12:28,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:12:28,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:12:28,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:12:28,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:12:28,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:12:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:12:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:12:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:12:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:12:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:12:28,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:12:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:12:28,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:12:28,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:12:28,632 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:12:28,635 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:12:28,640 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:12:28,708 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:12:28,733 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:12:28,758 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:12:35,417 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:12:35,642 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:12:35,642 INFO L309 CfgBuilder]: Removed 77 assume(true) statements. [2023-11-29 02:12:35,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:12:35 BoogieIcfgContainer [2023-11-29 02:12:35,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:12:35,646 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:12:35,646 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:12:35,648 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:12:35,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:12:26" (1/3) ... [2023-11-29 02:12:35,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c29daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:12:35, skipping insertion in model container [2023-11-29 02:12:35,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:12:27" (2/3) ... [2023-11-29 02:12:35,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c29daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:12:35, skipping insertion in model container [2023-11-29 02:12:35,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:12:35" (3/3) ... [2023-11-29 02:12:35,651 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-3.i [2023-11-29 02:12:35,668 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:12:35,668 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 851 error locations. [2023-11-29 02:12:35,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:12:35,740 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;@68f0fb54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:12:35,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 851 error locations. [2023-11-29 02:12:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 1485 states, 632 states have (on average 2.5838607594936707) internal successors, (1633), 1477 states have internal predecessors, (1633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:12:35,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 02:12:35,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:35,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 02:12:35,755 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr850ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:35,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:35,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2385053, now seen corresponding path program 1 times [2023-11-29 02:12:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:35,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501746125] [2023-11-29 02:12:35,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:35,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:35,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 02:12:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:36,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:12:36,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:36,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:36,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:36,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:36,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501746125] [2023-11-29 02:12:36,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501746125] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:36,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:36,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:12:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765731128] [2023-11-29 02:12:36,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:36,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:12:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:36,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:12:36,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:36,101 INFO L87 Difference]: Start difference. First operand has 1485 states, 632 states have (on average 2.5838607594936707) internal successors, (1633), 1477 states have internal predecessors, (1633), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:39,948 INFO L93 Difference]: Finished difference Result 1812 states and 1907 transitions. [2023-11-29 02:12:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:12:39,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 02:12:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:39,973 INFO L225 Difference]: With dead ends: 1812 [2023-11-29 02:12:39,973 INFO L226 Difference]: Without dead ends: 1809 [2023-11-29 02:12:39,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:39,978 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 364 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2078 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:39,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2078 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 02:12:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2023-11-29 02:12:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1480. [2023-11-29 02:12:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 638 states have (on average 2.4357366771159876) internal successors, (1554), 1472 states have internal predecessors, (1554), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:12:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1566 transitions. [2023-11-29 02:12:40,087 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1566 transitions. Word has length 3 [2023-11-29 02:12:40,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:40,087 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1566 transitions. [2023-11-29 02:12:40,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:40,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1566 transitions. [2023-11-29 02:12:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:12:40,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:40,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:12:40,092 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:12:40,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:40,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:40,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:40,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2005150439, now seen corresponding path program 1 times [2023-11-29 02:12:40,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:40,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289638605] [2023-11-29 02:12:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:40,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:40,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:40,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:40,309 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 02:12:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:40,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:12:40,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:40,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:12:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:40,518 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:40,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:40,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289638605] [2023-11-29 02:12:40,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289638605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:40,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:40,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:12:40,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176602606] [2023-11-29 02:12:40,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:12:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:40,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:12:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:40,523 INFO L87 Difference]: Start difference. First operand 1480 states and 1566 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:43,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:43,870 INFO L93 Difference]: Finished difference Result 1510 states and 1607 transitions. [2023-11-29 02:12:43,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:12:43,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 02:12:43,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:43,880 INFO L225 Difference]: With dead ends: 1510 [2023-11-29 02:12:43,880 INFO L226 Difference]: Without dead ends: 1510 [2023-11-29 02:12:43,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:43,882 INFO L413 NwaCegarLoop]: 777 mSDtfsCounter, 1029 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:43,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1030 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 02:12:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2023-11-29 02:12:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1453. [2023-11-29 02:12:43,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 704 states have (on average 2.25) internal successors, (1584), 1445 states have internal predecessors, (1584), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:12:43,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 1596 transitions. [2023-11-29 02:12:43,926 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 1596 transitions. Word has length 5 [2023-11-29 02:12:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:43,927 INFO L495 AbstractCegarLoop]: Abstraction has 1453 states and 1596 transitions. [2023-11-29 02:12:43,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:43,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 1596 transitions. [2023-11-29 02:12:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:12:43,928 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:43,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:12:43,930 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 02:12:44,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:44,129 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:44,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2005150438, now seen corresponding path program 1 times [2023-11-29 02:12:44,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:44,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465820043] [2023-11-29 02:12:44,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:44,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:44,130 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:44,131 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:44,132 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 02:12:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:44,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:12:44,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:44,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:12:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:44,288 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:44,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465820043] [2023-11-29 02:12:44,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465820043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:44,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:44,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:12:44,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230496643] [2023-11-29 02:12:44,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:44,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:12:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:44,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:12:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:44,291 INFO L87 Difference]: Start difference. First operand 1453 states and 1596 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:49,353 INFO L93 Difference]: Finished difference Result 1725 states and 1888 transitions. [2023-11-29 02:12:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:12:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-29 02:12:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:49,362 INFO L225 Difference]: With dead ends: 1725 [2023-11-29 02:12:49,362 INFO L226 Difference]: Without dead ends: 1725 [2023-11-29 02:12:49,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:49,363 INFO L413 NwaCegarLoop]: 1105 mSDtfsCounter, 456 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:49,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1626 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 02:12:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2023-11-29 02:12:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1576. [2023-11-29 02:12:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 837 states have (on average 2.218637992831541) internal successors, (1857), 1568 states have internal predecessors, (1857), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 02:12:49,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1869 transitions. [2023-11-29 02:12:49,407 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1869 transitions. Word has length 5 [2023-11-29 02:12:49,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:49,408 INFO L495 AbstractCegarLoop]: Abstraction has 1576 states and 1869 transitions. [2023-11-29 02:12:49,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:49,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1869 transitions. [2023-11-29 02:12:49,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 02:12:49,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:49,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 02:12:49,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 02:12:49,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:49,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:49,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:49,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2028430167, now seen corresponding path program 1 times [2023-11-29 02:12:49,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:49,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349011618] [2023-11-29 02:12:49,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:49,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:49,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:49,614 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:49,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 02:12:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:49,755 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:12:49,758 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:49,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 02:12:49,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:49,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349011618] [2023-11-29 02:12:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349011618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:49,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:49,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:12:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139138900] [2023-11-29 02:12:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:49,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:12:49,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:49,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:12:49,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:12:49,813 INFO L87 Difference]: Start difference. First operand 1576 states and 1869 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:52,923 INFO L93 Difference]: Finished difference Result 2679 states and 3172 transitions. [2023-11-29 02:12:52,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:12:52,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 02:12:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:52,937 INFO L225 Difference]: With dead ends: 2679 [2023-11-29 02:12:52,938 INFO L226 Difference]: Without dead ends: 2679 [2023-11-29 02:12:52,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:12:52,939 INFO L413 NwaCegarLoop]: 1275 mSDtfsCounter, 1072 mSDsluCounter, 2275 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:52,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 3550 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 02:12:52,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2023-11-29 02:12:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2022. [2023-11-29 02:12:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2022 states, 1283 states have (on average 2.176149649259548) internal successors, (2792), 2011 states have internal predecessors, (2792), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:12:53,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2810 transitions. [2023-11-29 02:12:53,002 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2810 transitions. Word has length 6 [2023-11-29 02:12:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:53,003 INFO L495 AbstractCegarLoop]: Abstraction has 2022 states and 2810 transitions. [2023-11-29 02:12:53,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2810 transitions. [2023-11-29 02:12:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:12:53,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:53,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:12:53,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 02:12:53,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:53,209 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr647REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:53,209 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:53,209 INFO L85 PathProgramCache]: Analyzing trace with hash 593798675, now seen corresponding path program 1 times [2023-11-29 02:12:53,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:53,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [261868910] [2023-11-29 02:12:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:53,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:53,212 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:53,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 02:12:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:53,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:12:53,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:53,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:53,418 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:53,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:53,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [261868910] [2023-11-29 02:12:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [261868910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:53,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:53,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:12:53,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311338205] [2023-11-29 02:12:53,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:53,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:12:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:53,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:12:53,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:53,420 INFO L87 Difference]: Start difference. First operand 2022 states and 2810 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:55,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:55,337 INFO L93 Difference]: Finished difference Result 2304 states and 2944 transitions. [2023-11-29 02:12:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:12:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-11-29 02:12:55,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:55,351 INFO L225 Difference]: With dead ends: 2304 [2023-11-29 02:12:55,351 INFO L226 Difference]: Without dead ends: 2304 [2023-11-29 02:12:55,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:55,352 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 543 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2487 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:55,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2487 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 02:12:55,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2023-11-29 02:12:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1913. [2023-11-29 02:12:55,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1174 states have (on average 2.183986371379898) internal successors, (2564), 1902 states have internal predecessors, (2564), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:12:55,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2582 transitions. [2023-11-29 02:12:55,397 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2582 transitions. Word has length 8 [2023-11-29 02:12:55,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:55,397 INFO L495 AbstractCegarLoop]: Abstraction has 1913 states and 2582 transitions. [2023-11-29 02:12:55,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2582 transitions. [2023-11-29 02:12:55,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:12:55,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:55,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:12:55,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 02:12:55,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:55,601 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr649REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:55,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:55,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1106372499, now seen corresponding path program 1 times [2023-11-29 02:12:55,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:55,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [136829528] [2023-11-29 02:12:55,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:55,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:55,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:55,603 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:55,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 02:12:55,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:55,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:12:55,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:55,783 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:55,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [136829528] [2023-11-29 02:12:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [136829528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:55,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:55,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:12:55,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135392214] [2023-11-29 02:12:55,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:55,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:12:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:12:55,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:12:55,786 INFO L87 Difference]: Start difference. First operand 1913 states and 2582 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:58,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:58,833 INFO L93 Difference]: Finished difference Result 2304 states and 2943 transitions. [2023-11-29 02:12:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:12:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:12:58,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:58,845 INFO L225 Difference]: With dead ends: 2304 [2023-11-29 02:12:58,845 INFO L226 Difference]: Without dead ends: 2298 [2023-11-29 02:12:58,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:12:58,847 INFO L413 NwaCegarLoop]: 1326 mSDtfsCounter, 549 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 3619 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:58,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 3619 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 02:12:58,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2023-11-29 02:12:58,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 1907. [2023-11-29 02:12:58,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1907 states, 1168 states have (on average 2.1892123287671232) internal successors, (2557), 1896 states have internal predecessors, (2557), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:12:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1907 states to 1907 states and 2575 transitions. [2023-11-29 02:12:58,887 INFO L78 Accepts]: Start accepts. Automaton has 1907 states and 2575 transitions. Word has length 11 [2023-11-29 02:12:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:58,888 INFO L495 AbstractCegarLoop]: Abstraction has 1907 states and 2575 transitions. [2023-11-29 02:12:58,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:12:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1907 states and 2575 transitions. [2023-11-29 02:12:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:12:58,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:58,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:12:58,892 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 02:12:59,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:59,098 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:12:59,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -251212221, now seen corresponding path program 1 times [2023-11-29 02:12:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038367689] [2023-11-29 02:12:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:59,099 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:12:59,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:59,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:12:59,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 02:12:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:59,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:12:59,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:59,284 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:12:59,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:59,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038367689] [2023-11-29 02:12:59,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038367689] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:12:59,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:12:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:12:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368538454] [2023-11-29 02:12:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:12:59,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:12:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:12:59,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:12:59,286 INFO L87 Difference]: Start difference. First operand 1907 states and 2575 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:00,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:00,702 INFO L93 Difference]: Finished difference Result 1853 states and 2495 transitions. [2023-11-29 02:13:00,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:13:00,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:13:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:00,714 INFO L225 Difference]: With dead ends: 1853 [2023-11-29 02:13:00,714 INFO L226 Difference]: Without dead ends: 1853 [2023-11-29 02:13:00,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:13:00,715 INFO L413 NwaCegarLoop]: 1229 mSDtfsCounter, 70 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:00,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2409 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:13:00,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2023-11-29 02:13:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1853. [2023-11-29 02:13:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1138 states have (on average 2.1766256590509667) internal successors, (2477), 1842 states have internal predecessors, (2477), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 2495 transitions. [2023-11-29 02:13:00,758 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 2495 transitions. Word has length 11 [2023-11-29 02:13:00,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:00,759 INFO L495 AbstractCegarLoop]: Abstraction has 1853 states and 2495 transitions. [2023-11-29 02:13:00,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:00,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 2495 transitions. [2023-11-29 02:13:00,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 02:13:00,759 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:00,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:00,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 02:13:00,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:00,960 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:00,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:00,961 INFO L85 PathProgramCache]: Analyzing trace with hash -896778947, now seen corresponding path program 1 times [2023-11-29 02:13:00,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:00,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [608046215] [2023-11-29 02:13:00,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:00,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:00,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:00,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 02:13:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:01,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:13:01,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:01,128 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:01,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:01,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [608046215] [2023-11-29 02:13:01,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [608046215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:01,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:01,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:13:01,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957383897] [2023-11-29 02:13:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:01,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:13:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:01,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:13:01,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:01,131 INFO L87 Difference]: Start difference. First operand 1853 states and 2495 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:02,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:02,899 INFO L93 Difference]: Finished difference Result 1839 states and 2453 transitions. [2023-11-29 02:13:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:13:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-29 02:13:02,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:02,909 INFO L225 Difference]: With dead ends: 1839 [2023-11-29 02:13:02,909 INFO L226 Difference]: Without dead ends: 1839 [2023-11-29 02:13:02,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:02,910 INFO L413 NwaCegarLoop]: 1198 mSDtfsCounter, 58 mSDsluCounter, 2372 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3570 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:02,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3570 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 02:13:02,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2023-11-29 02:13:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1837. [2023-11-29 02:13:02,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1136 states have (on average 2.141725352112676) internal successors, (2433), 1826 states have internal predecessors, (2433), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:02,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2451 transitions. [2023-11-29 02:13:02,951 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2451 transitions. Word has length 13 [2023-11-29 02:13:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:02,952 INFO L495 AbstractCegarLoop]: Abstraction has 1837 states and 2451 transitions. [2023-11-29 02:13:02,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2451 transitions. [2023-11-29 02:13:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:13:02,953 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:02,953 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:02,957 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 02:13:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:03,156 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:03,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 80004107, now seen corresponding path program 1 times [2023-11-29 02:13:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1931398833] [2023-11-29 02:13:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:03,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:03,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:03,158 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:03,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 02:13:03,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:03,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:13:03,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:03,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:13:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:03,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:03,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:03,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1931398833] [2023-11-29 02:13:03,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1931398833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:03,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:03,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:13:03,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377734653] [2023-11-29 02:13:03,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:03,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:13:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:03,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:13:03,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:03,393 INFO L87 Difference]: Start difference. First operand 1837 states and 2451 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:07,554 INFO L93 Difference]: Finished difference Result 1890 states and 2454 transitions. [2023-11-29 02:13:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:13:07,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:13:07,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:07,563 INFO L225 Difference]: With dead ends: 1890 [2023-11-29 02:13:07,563 INFO L226 Difference]: Without dead ends: 1890 [2023-11-29 02:13:07,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:07,564 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 964 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:07,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 1519 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 02:13:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2023-11-29 02:13:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1833. [2023-11-29 02:13:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1833 states, 1136 states have (on average 2.1346830985915495) internal successors, (2425), 1822 states have internal predecessors, (2425), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:07,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1833 states to 1833 states and 2443 transitions. [2023-11-29 02:13:07,600 INFO L78 Accepts]: Start accepts. Automaton has 1833 states and 2443 transitions. Word has length 27 [2023-11-29 02:13:07,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:07,600 INFO L495 AbstractCegarLoop]: Abstraction has 1833 states and 2443 transitions. [2023-11-29 02:13:07,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:07,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1833 states and 2443 transitions. [2023-11-29 02:13:07,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:13:07,601 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:07,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:07,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 02:13:07,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:07,802 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:07,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash 80004108, now seen corresponding path program 1 times [2023-11-29 02:13:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [472200501] [2023-11-29 02:13:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:07,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:07,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:07,804 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:07,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 02:13:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:07,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:13:07,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:07,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:13:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:08,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:08,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:08,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [472200501] [2023-11-29 02:13:08,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [472200501] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:13:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385978750] [2023-11-29 02:13:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:08,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:13:08,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:08,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:13:08,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:08,126 INFO L87 Difference]: Start difference. First operand 1833 states and 2443 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:14,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:14,211 INFO L93 Difference]: Finished difference Result 1978 states and 2454 transitions. [2023-11-29 02:13:14,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:13:14,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:13:14,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:14,221 INFO L225 Difference]: With dead ends: 1978 [2023-11-29 02:13:14,221 INFO L226 Difference]: Without dead ends: 1978 [2023-11-29 02:13:14,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:14,222 INFO L413 NwaCegarLoop]: 1301 mSDtfsCounter, 393 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 2516 SdHoareTripleChecker+Invalid, 1982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:14,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 2516 Invalid, 1982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2023-11-29 02:13:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2023-11-29 02:13:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1829. [2023-11-29 02:13:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1829 states, 1136 states have (on average 2.1276408450704225) internal successors, (2417), 1818 states have internal predecessors, (2417), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 2435 transitions. [2023-11-29 02:13:14,252 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 2435 transitions. Word has length 27 [2023-11-29 02:13:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:14,253 INFO L495 AbstractCegarLoop]: Abstraction has 1829 states and 2435 transitions. [2023-11-29 02:13:14,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 2435 transitions. [2023-11-29 02:13:14,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:13:14,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:14,255 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 02:13:14,259 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 02:13:14,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:14,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:14,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:14,456 INFO L85 PathProgramCache]: Analyzing trace with hash 935617745, now seen corresponding path program 1 times [2023-11-29 02:13:14,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:14,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096437445] [2023-11-29 02:13:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:14,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:14,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:14,458 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:14,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 02:13:14,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:14,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:13:14,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:14,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:14,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:14,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:14,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096437445] [2023-11-29 02:13:14,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096437445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:14,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:14,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:13:14,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862931197] [2023-11-29 02:13:14,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:14,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:13:14,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:14,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:13:14,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:14,772 INFO L87 Difference]: Start difference. First operand 1829 states and 2435 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 02:13:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:16,479 INFO L93 Difference]: Finished difference Result 1817 states and 2415 transitions. [2023-11-29 02:13:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:13:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 02:13:16,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:16,493 INFO L225 Difference]: With dead ends: 1817 [2023-11-29 02:13:16,493 INFO L226 Difference]: Without dead ends: 1817 [2023-11-29 02:13:16,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:16,494 INFO L413 NwaCegarLoop]: 1192 mSDtfsCounter, 23 mSDsluCounter, 2364 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3556 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:16,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3556 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 02:13:16,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-11-29 02:13:16,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1817. [2023-11-29 02:13:16,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1817 states, 1124 states have (on average 2.132562277580071) internal successors, (2397), 1806 states have internal predecessors, (2397), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1817 states to 1817 states and 2415 transitions. [2023-11-29 02:13:16,523 INFO L78 Accepts]: Start accepts. Automaton has 1817 states and 2415 transitions. Word has length 46 [2023-11-29 02:13:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:16,524 INFO L495 AbstractCegarLoop]: Abstraction has 1817 states and 2415 transitions. [2023-11-29 02:13:16,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 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 02:13:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1817 states and 2415 transitions. [2023-11-29 02:13:16,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 02:13:16,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:16,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:16,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 02:13:16,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:16,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:16,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:16,726 INFO L85 PathProgramCache]: Analyzing trace with hash 560683185, now seen corresponding path program 1 times [2023-11-29 02:13:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447427783] [2023-11-29 02:13:16,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:16,727 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:16,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:16,728 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:16,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 02:13:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:17,081 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:13:17,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:17,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:13:17,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:13:17,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:13:17,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 02:13:17,660 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:13:17,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:13:17,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:17,685 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:17,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:17,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447427783] [2023-11-29 02:13:17,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [447427783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:17,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:17,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:13:17,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289543630] [2023-11-29 02:13:17,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:17,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:13:17,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:17,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:13:17,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:17,688 INFO L87 Difference]: Start difference. First operand 1817 states and 2415 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:22,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:22,225 INFO L93 Difference]: Finished difference Result 1789 states and 2299 transitions. [2023-11-29 02:13:22,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:13:22,226 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 02:13:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:22,234 INFO L225 Difference]: With dead ends: 1789 [2023-11-29 02:13:22,234 INFO L226 Difference]: Without dead ends: 1789 [2023-11-29 02:13:22,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:22,235 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 943 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 1349 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:22,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 860 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1349 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 02:13:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2023-11-29 02:13:22,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1600. [2023-11-29 02:13:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 991 states have (on average 2.005045408678103) internal successors, (1987), 1589 states have internal predecessors, (1987), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2023-11-29 02:13:22,267 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 50 [2023-11-29 02:13:22,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:22,267 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2023-11-29 02:13:22,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:22,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2023-11-29 02:13:22,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:13:22,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:22,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:22,275 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 02:13:22,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:22,470 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:22,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:22,470 INFO L85 PathProgramCache]: Analyzing trace with hash -852831317, now seen corresponding path program 1 times [2023-11-29 02:13:22,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:22,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246419107] [2023-11-29 02:13:22,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:22,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:22,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:22,472 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:22,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 02:13:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:22,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:13:22,721 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:22,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:13:22,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:13:22,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:13:22,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:22,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:22,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:22,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246419107] [2023-11-29 02:13:22,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246419107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:22,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:22,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:13:22,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990199540] [2023-11-29 02:13:22,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:22,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:13:22,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:22,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:13:22,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:22,791 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:27,889 INFO L93 Difference]: Finished difference Result 1599 states and 2003 transitions. [2023-11-29 02:13:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:13:27,891 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 02:13:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:27,899 INFO L225 Difference]: With dead ends: 1599 [2023-11-29 02:13:27,899 INFO L226 Difference]: Without dead ends: 1599 [2023-11-29 02:13:27,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:13:27,900 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 3 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 2276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:27,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2796 Invalid, 2276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-11-29 02:13:27,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2023-11-29 02:13:27,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1599. [2023-11-29 02:13:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1599 states, 991 states have (on average 2.003027245206862) internal successors, (1985), 1588 states have internal predecessors, (1985), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:27,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1599 states to 1599 states and 2003 transitions. [2023-11-29 02:13:27,924 INFO L78 Accepts]: Start accepts. Automaton has 1599 states and 2003 transitions. Word has length 54 [2023-11-29 02:13:27,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:27,924 INFO L495 AbstractCegarLoop]: Abstraction has 1599 states and 2003 transitions. [2023-11-29 02:13:27,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:27,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2003 transitions. [2023-11-29 02:13:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 02:13:27,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:27,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:27,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 02:13:28,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:28,126 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:28,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash -852831316, now seen corresponding path program 1 times [2023-11-29 02:13:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:28,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937015124] [2023-11-29 02:13:28,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:28,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:28,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:28,128 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:28,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 02:13:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:28,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:13:28,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:28,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:13:28,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:13:28,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:13:28,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 02:13:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:28,470 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:28,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:28,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937015124] [2023-11-29 02:13:28,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [937015124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:28,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:28,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:13:28,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429889476] [2023-11-29 02:13:28,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:28,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:13:28,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:13:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:28,472 INFO L87 Difference]: Start difference. First operand 1599 states and 2003 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:34,937 INFO L93 Difference]: Finished difference Result 1598 states and 2001 transitions. [2023-11-29 02:13:34,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:13:34,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 02:13:34,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:34,944 INFO L225 Difference]: With dead ends: 1598 [2023-11-29 02:13:34,945 INFO L226 Difference]: Without dead ends: 1598 [2023-11-29 02:13:34,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:13:34,945 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 1 mSDsluCounter, 1725 mSDsCounter, 0 mSdLazyCounter, 2224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2845 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:34,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2845 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2224 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-11-29 02:13:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2023-11-29 02:13:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2023-11-29 02:13:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 989 states have (on average 2.005055611729019) internal successors, (1983), 1587 states have internal predecessors, (1983), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 02:13:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2001 transitions. [2023-11-29 02:13:34,968 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2001 transitions. Word has length 54 [2023-11-29 02:13:34,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:34,969 INFO L495 AbstractCegarLoop]: Abstraction has 1598 states and 2001 transitions. [2023-11-29 02:13:34,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2001 transitions. [2023-11-29 02:13:34,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:13:34,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:34,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:34,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 02:13:35,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:35,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:35,171 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:35,171 INFO L85 PathProgramCache]: Analyzing trace with hash 862131375, now seen corresponding path program 1 times [2023-11-29 02:13:35,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:35,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175960800] [2023-11-29 02:13:35,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:35,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:35,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:35,173 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:35,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 02:13:35,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:35,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:13:35,446 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:35,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:35,464 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:13:35,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:35,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175960800] [2023-11-29 02:13:35,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175960800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:13:35,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:13:35,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:13:35,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675946792] [2023-11-29 02:13:35,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:13:35,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:13:35,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:35,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:13:35,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:13:35,466 INFO L87 Difference]: Start difference. First operand 1598 states and 2001 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:13:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:37,249 INFO L93 Difference]: Finished difference Result 1600 states and 2006 transitions. [2023-11-29 02:13:37,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:13:37,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2023-11-29 02:13:37,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:37,259 INFO L225 Difference]: With dead ends: 1600 [2023-11-29 02:13:37,259 INFO L226 Difference]: Without dead ends: 1600 [2023-11-29 02:13:37,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:13:37,260 INFO L413 NwaCegarLoop]: 1119 mSDtfsCounter, 1 mSDsluCounter, 2232 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3351 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:37,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3351 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 02:13:37,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2023-11-29 02:13:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2023-11-29 02:13:37,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 990 states have (on average 2.005050505050505) internal successors, (1985), 1589 states have internal predecessors, (1985), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:13:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2006 transitions. [2023-11-29 02:13:37,296 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2006 transitions. Word has length 60 [2023-11-29 02:13:37,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:37,297 INFO L495 AbstractCegarLoop]: Abstraction has 1600 states and 2006 transitions. [2023-11-29 02:13:37,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:13:37,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2006 transitions. [2023-11-29 02:13:37,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 02:13:37,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:37,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:37,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 02:13:37,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:37,499 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:37,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash 65021760, now seen corresponding path program 1 times [2023-11-29 02:13:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271579974] [2023-11-29 02:13:37,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:37,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:37,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:37,501 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:37,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 02:13:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:37,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:13:37,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:37,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:13:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:37,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:37,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271579974] [2023-11-29 02:13:37,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271579974] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:13:37,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:13:37,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:13:37,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034475709] [2023-11-29 02:13:37,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:13:37,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:13:37,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:37,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:13:37,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:13:37,893 INFO L87 Difference]: Start difference. First operand 1600 states and 2006 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:13:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:39,849 INFO L93 Difference]: Finished difference Result 1609 states and 2022 transitions. [2023-11-29 02:13:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:13:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2023-11-29 02:13:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:39,856 INFO L225 Difference]: With dead ends: 1609 [2023-11-29 02:13:39,857 INFO L226 Difference]: Without dead ends: 1609 [2023-11-29 02:13:39,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:13:39,858 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 6 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3347 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:39,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3347 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 02:13:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states. [2023-11-29 02:13:39,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1608. [2023-11-29 02:13:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 997 states have (on average 2.004012036108325) internal successors, (1998), 1596 states have internal predecessors, (1998), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:13:39,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2019 transitions. [2023-11-29 02:13:39,897 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2019 transitions. Word has length 61 [2023-11-29 02:13:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:39,897 INFO L495 AbstractCegarLoop]: Abstraction has 1608 states and 2019 transitions. [2023-11-29 02:13:39,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:13:39,897 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2019 transitions. [2023-11-29 02:13:39,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 02:13:39,898 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:39,898 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:39,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 02:13:40,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:40,099 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:40,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -212094737, now seen corresponding path program 2 times [2023-11-29 02:13:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:40,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644705390] [2023-11-29 02:13:40,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:13:40,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:40,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:40,102 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:40,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 02:13:40,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:13:40,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:13:40,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:13:40,565 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:40,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:13:40,795 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:40,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:40,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644705390] [2023-11-29 02:13:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644705390] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:13:40,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:13:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:13:40,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596265279] [2023-11-29 02:13:40,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:13:40,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:13:40,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:13:40,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:13:40,798 INFO L87 Difference]: Start difference. First operand 1608 states and 2019 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:13:46,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:46,105 INFO L93 Difference]: Finished difference Result 1623 states and 2049 transitions. [2023-11-29 02:13:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:13:46,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 64 [2023-11-29 02:13:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:46,111 INFO L225 Difference]: With dead ends: 1623 [2023-11-29 02:13:46,111 INFO L226 Difference]: Without dead ends: 1621 [2023-11-29 02:13:46,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:13:46,112 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 12 mSDsluCounter, 10025 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 11142 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:46,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 11142 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 02:13:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1621 states. [2023-11-29 02:13:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1621 to 1617. [2023-11-29 02:13:46,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1006 states have (on average 1.9980119284294235) internal successors, (2010), 1605 states have internal predecessors, (2010), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:13:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2031 transitions. [2023-11-29 02:13:46,135 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2031 transitions. Word has length 64 [2023-11-29 02:13:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:46,135 INFO L495 AbstractCegarLoop]: Abstraction has 1617 states and 2031 transitions. [2023-11-29 02:13:46,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:13:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2031 transitions. [2023-11-29 02:13:46,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 02:13:46,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:46,136 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:46,142 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 02:13:46,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:46,337 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:46,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1391091535, now seen corresponding path program 3 times [2023-11-29 02:13:46,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:46,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014030362] [2023-11-29 02:13:46,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:13:46,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:46,339 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:46,339 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:46,340 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 02:13:47,011 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:13:47,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:13:47,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:13:47,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:47,177 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:47,177 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:13:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:47,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:13:47,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014030362] [2023-11-29 02:13:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014030362] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:13:47,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:13:47,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:13:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142966244] [2023-11-29 02:13:47,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:13:47,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:13:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:47,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:13:47,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:13:47,952 INFO L87 Difference]: Start difference. First operand 1617 states and 2031 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:13:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:58,647 INFO L93 Difference]: Finished difference Result 1647 states and 2109 transitions. [2023-11-29 02:13:58,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:13:58,648 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 02:13:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:58,656 INFO L225 Difference]: With dead ends: 1647 [2023-11-29 02:13:58,656 INFO L226 Difference]: Without dead ends: 1644 [2023-11-29 02:13:58,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 02:13:58,658 INFO L413 NwaCegarLoop]: 1115 mSDtfsCounter, 24 mSDsluCounter, 16681 mSDsCounter, 0 mSdLazyCounter, 3357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17796 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:58,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17796 Invalid, 3378 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 3357 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 02:13:58,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2023-11-29 02:13:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1635. [2023-11-29 02:13:58,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1024 states have (on average 1.9853515625) internal successors, (2033), 1623 states have internal predecessors, (2033), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:13:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2054 transitions. [2023-11-29 02:13:58,686 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2054 transitions. Word has length 70 [2023-11-29 02:13:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:58,687 INFO L495 AbstractCegarLoop]: Abstraction has 1635 states and 2054 transitions. [2023-11-29 02:13:58,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:13:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2054 transitions. [2023-11-29 02:13:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 02:13:58,688 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:58,688 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:58,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:13:58,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:58,889 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:13:58,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:58,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1666128881, now seen corresponding path program 4 times [2023-11-29 02:13:58,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:13:58,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571516381] [2023-11-29 02:13:58,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:13:58,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:13:58,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:13:58,891 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:13:58,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 02:13:59,270 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:13:59,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:13:59,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:13:59,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:59,723 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:14:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:14:01,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:14:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571516381] [2023-11-29 02:14:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571516381] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:14:01,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:14:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:14:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511569267] [2023-11-29 02:14:01,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:14:01,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:14:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:14:01,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:14:01,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:14:01,505 INFO L87 Difference]: Start difference. First operand 1635 states and 2054 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:14:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:14:23,057 INFO L93 Difference]: Finished difference Result 1692 states and 2185 transitions. [2023-11-29 02:14:23,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:14:23,058 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2023-11-29 02:14:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:14:23,062 INFO L225 Difference]: With dead ends: 1692 [2023-11-29 02:14:23,062 INFO L226 Difference]: Without dead ends: 1690 [2023-11-29 02:14:23,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 02:14:23,068 INFO L413 NwaCegarLoop]: 1117 mSDtfsCounter, 48 mSDsluCounter, 26758 mSDsCounter, 0 mSdLazyCounter, 6643 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 27875 SdHoareTripleChecker+Invalid, 6786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 6643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:14:23,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 27875 Invalid, 6786 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [143 Valid, 6643 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2023-11-29 02:14:23,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2023-11-29 02:14:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1669. [2023-11-29 02:14:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1058 states have (on average 1.9650283553875236) internal successors, (2079), 1657 states have internal predecessors, (2079), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-29 02:14:23,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2100 transitions. [2023-11-29 02:14:23,103 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2100 transitions. Word has length 82 [2023-11-29 02:14:23,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:14:23,103 INFO L495 AbstractCegarLoop]: Abstraction has 1669 states and 2100 transitions. [2023-11-29 02:14:23,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 02:14:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2100 transitions. [2023-11-29 02:14:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:14:23,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:14:23,105 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:14:23,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 02:14:23,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:14:23,306 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:14:23,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:14:23,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1271065455, now seen corresponding path program 5 times [2023-11-29 02:14:23,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:14:23,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287691594] [2023-11-29 02:14:23,307 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:14:23,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:14:23,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:14:23,309 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:14:23,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 02:14:24,972 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:14:24,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:14:25,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 02:14:25,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:14:25,037 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:14:25,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 02:14:25,516 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:14:25,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 02:14:25,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:14:25,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2023-11-29 02:14:28,705 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:14:28,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 02:14:28,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2023-11-29 02:14:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:14:28,872 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:14:29,385 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (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_1592) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:14:29,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:14:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287691594] [2023-11-29 02:14:29,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287691594] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:14:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1148851994] [2023-11-29 02:14:29,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:14:29,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:14:29,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:14:29,389 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:14:29,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-11-29 02:15:36,378 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:15:36,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:15:36,581 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:15:36,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:15:36,640 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:15:36,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:15:37,084 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:15:37,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:15:37,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:15:37,850 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:15:37,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:15:37,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:15:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:15:37,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:15:38,418 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 02:15:38,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2023-11-29 02:15:38,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2036 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2036) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 02:15:38,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1148851994] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:15:38,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:15:38,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-29 02:15:38,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739507709] [2023-11-29 02:15:38,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:15:38,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:15:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:15:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:15:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=410, Unknown=2, NotChecked=82, Total=552 [2023-11-29 02:15:38,433 INFO L87 Difference]: Start difference. First operand 1669 states and 2100 transitions. Second operand has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:16:15,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:16:15,659 INFO L93 Difference]: Finished difference Result 2979 states and 3454 transitions. [2023-11-29 02:16:15,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 02:16:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 104 [2023-11-29 02:16:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:16:15,665 INFO L225 Difference]: With dead ends: 2979 [2023-11-29 02:16:15,665 INFO L226 Difference]: Without dead ends: 2975 [2023-11-29 02:16:15,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=1627, Unknown=2, NotChecked=170, Total=2070 [2023-11-29 02:16:15,666 INFO L413 NwaCegarLoop]: 837 mSDtfsCounter, 4737 mSDsluCounter, 11843 mSDsCounter, 0 mSdLazyCounter, 16910 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4737 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 17045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 16910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:16:15,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4737 Valid, 12680 Invalid, 17045 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [135 Valid, 16910 Invalid, 0 Unknown, 0 Unchecked, 35.9s Time] [2023-11-29 02:16:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2023-11-29 02:16:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2118. [2023-11-29 02:16:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 1502 states have (on average 1.8521970705725699) internal successors, (2782), 2098 states have internal predecessors, (2782), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:16:15,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 2817 transitions. [2023-11-29 02:16:15,701 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 2817 transitions. Word has length 104 [2023-11-29 02:16:15,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:16:15,702 INFO L495 AbstractCegarLoop]: Abstraction has 2118 states and 2817 transitions. [2023-11-29 02:16:15,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:16:15,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 2817 transitions. [2023-11-29 02:16:15,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:16:15,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:16:15,703 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:16:15,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-11-29 02:16:15,913 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 02:16:16,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:16:16,104 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:16:16,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:16:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1271065456, now seen corresponding path program 1 times [2023-11-29 02:16:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:16:16,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441611180] [2023-11-29 02:16:16,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:16,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:16:16,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:16:16,107 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:16:16,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (23)] Waiting until timeout for monitored process [2023-11-29 02:16:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:16:16,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 02:16:16,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:16:16,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:16:17,201 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:16:17,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:16:17,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:16:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:16:17,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:16:17,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:16:17,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:16:18,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:16:18,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:16:18,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:16:18,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:16:18,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:16:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:16:18,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:16:19,703 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2572 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2573 (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_2573) |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_2572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2573 (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_2573) |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 02:16:19,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:16:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441611180] [2023-11-29 02:16:19,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441611180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:16:19,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1522515317] [2023-11-29 02:16:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:16:19,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:16:19,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:16:19,711 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:16:19,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 02:18:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:12,160 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:18:12,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:12,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:18:12,430 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:18:12,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:18:12,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:18:12,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:18:12,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:18:12,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:18:12,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:18:13,213 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:18:13,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:18:13,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:18:13,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:18:13,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:18:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:18:13,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:14,769 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3109 (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_3109) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3110 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3109) |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~mem33#1.base| v_ArrVal_3110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:18:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1522515317] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:14,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:18:14,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 02:18:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514863695] [2023-11-29 02:18:14,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:18:14,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:18:14,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:18:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:18:14,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:18:14,777 INFO L87 Difference]: Start difference. First operand 2118 states and 2817 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:18:28,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:18:28,822 INFO L93 Difference]: Finished difference Result 2461 states and 3126 transitions. [2023-11-29 02:18:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:18:28,822 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2023-11-29 02:18:28,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:18:28,827 INFO L225 Difference]: With dead ends: 2461 [2023-11-29 02:18:28,827 INFO L226 Difference]: Without dead ends: 2461 [2023-11-29 02:18:28,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:18:28,828 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 706 mSDsluCounter, 2353 mSDsCounter, 0 mSdLazyCounter, 5059 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 5070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:18:28,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3335 Invalid, 5070 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 5059 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2023-11-29 02:18:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2461 states. [2023-11-29 02:18:28,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2461 to 2117. [2023-11-29 02:18:28,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 1502 states have (on average 1.8501997336884155) internal successors, (2779), 2097 states have internal predecessors, (2779), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:18:28,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 2814 transitions. [2023-11-29 02:18:28,856 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 2814 transitions. Word has length 104 [2023-11-29 02:18:28,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:18:28,856 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 2814 transitions. [2023-11-29 02:18:28,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 02:18:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 2814 transitions. [2023-11-29 02:18:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:18:28,857 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:18:28,857 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:18:28,903 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-11-29 02:18:29,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (23)] Ended with exit code 0 [2023-11-29 02:18:29,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:18:29,258 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:18:29,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:18:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1725259505, now seen corresponding path program 1 times [2023-11-29 02:18:29,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:18:29,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157913187] [2023-11-29 02:18:29,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:29,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:18:29,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:18:29,260 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:18:29,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (25)] Waiting until timeout for monitored process [2023-11-29 02:18:30,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:30,139 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 02:18:30,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:30,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:18:30,267 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:18:30,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:18:30,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:18:30,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:18:31,326 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:18:31,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 44 treesize of output 43 [2023-11-29 02:18:31,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:18:31,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:18:31,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:18:31,516 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:18:31,516 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:32,114 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:18:32,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3562 (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~mem33#1.base| v_ArrVal_3562))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3516)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:18:32,498 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:18:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157913187] [2023-11-29 02:18:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157913187] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580578293] [2023-11-29 02:18:32,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:18:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:18:32,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:18:32,500 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:18:32,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 02:18:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:18:36,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:18:36,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:18:36,539 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:18:36,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:18:36,971 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:18:36,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:18:37,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:18:37,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:18:37,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:18:37,882 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:18:37,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:18:37,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:18:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:18:37,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:37,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (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_3967) |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 02:18:37,965 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (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_3967) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:18:38,411 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 02:18:38,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2023-11-29 02:18:38,422 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3967 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4013 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4013))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3967)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:18:38,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [580578293] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:38,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:18:38,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2023-11-29 02:18:38,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202150619] [2023-11-29 02:18:38,426 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:18:38,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:18:38,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:18:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:18:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=486, Unknown=5, NotChecked=240, Total=812 [2023-11-29 02:18:38,428 INFO L87 Difference]: Start difference. First operand 2117 states and 2814 transitions. Second operand has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:19:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:11,188 INFO L93 Difference]: Finished difference Result 2971 states and 3440 transitions. [2023-11-29 02:19:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:19:11,188 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 02:19:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:11,193 INFO L225 Difference]: With dead ends: 2971 [2023-11-29 02:19:11,193 INFO L226 Difference]: Without dead ends: 2971 [2023-11-29 02:19:11,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=202, Invalid=1219, Unknown=5, NotChecked=380, Total=1806 [2023-11-29 02:19:11,194 INFO L413 NwaCegarLoop]: 1008 mSDtfsCounter, 1882 mSDsluCounter, 12005 mSDsCounter, 0 mSdLazyCounter, 16036 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 13013 SdHoareTripleChecker+Invalid, 16077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 16036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:11,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 13013 Invalid, 16077 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 16036 Invalid, 0 Unknown, 0 Unchecked, 31.8s Time] [2023-11-29 02:19:11,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2023-11-29 02:19:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2116. [2023-11-29 02:19:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2116 states, 1502 states have (on average 1.848202396804261) internal successors, (2776), 2096 states have internal predecessors, (2776), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:19:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 2811 transitions. [2023-11-29 02:19:11,220 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 2811 transitions. Word has length 106 [2023-11-29 02:19:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:11,221 INFO L495 AbstractCegarLoop]: Abstraction has 2116 states and 2811 transitions. [2023-11-29 02:19:11,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.888888888888889) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:19:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 2811 transitions. [2023-11-29 02:19:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 02:19:11,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:11,222 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:11,234 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (25)] Ended with exit code 0 [2023-11-29 02:19:11,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-11-29 02:19:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:19:11,623 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:19:11,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1725259506, now seen corresponding path program 1 times [2023-11-29 02:19:11,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:19:11,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192308186] [2023-11-29 02:19:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:11,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:19:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:19:11,625 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:19:11,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Waiting until timeout for monitored process [2023-11-29 02:19:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:12,571 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 02:19:12,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:12,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:19:12,683 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:19:12,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:19:12,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:19:12,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:19:12,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:19:12,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:19:12,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:19:13,501 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:19:13,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:19:13,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:19:13,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:19:13,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:19:13,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:19:13,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:19:13,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:19:13,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 02:19:13,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:13,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (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_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4465 (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_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 02:19:13,899 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_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-29 02:19:15,369 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4465 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4466 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4558))) (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_4557) .cse0 v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4466) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4557 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4558 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4465 (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_4557) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4558) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4465) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-11-29 02:19:15,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:19:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192308186] [2023-11-29 02:19:15,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1192308186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:15,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1639168801] [2023-11-29 02:19:15,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:15,385 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:19:15,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:19:15,386 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:19:15,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-11-29 02:19:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:19,479 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 02:19:19,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:19,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:19:19,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:19:19,765 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:19:19,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:19:19,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:19:19,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:19:19,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:19:19,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:19:20,639 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:19:20,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:19:20,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:19:20,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:19:20,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:19:20,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:19:20,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:19:20,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:19:20,859 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:19:20,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:20,917 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (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_5011) |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_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5011 (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_5011) |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 02:19:20,956 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_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:19:22,419 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5010 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5103))) (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_5102) .cse0 v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5011 (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_5102) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5103) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 02:19:22,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1639168801] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:22,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:19:22,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 02:19:22,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138680947] [2023-11-29 02:19:22,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:19:22,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:19:22,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:19:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:19:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 02:19:22,431 INFO L87 Difference]: Start difference. First operand 2116 states and 2811 transitions. Second operand has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:19:48,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:19:48,407 INFO L93 Difference]: Finished difference Result 2469 states and 3131 transitions. [2023-11-29 02:19:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:19:48,408 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2023-11-29 02:19:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:19:48,413 INFO L225 Difference]: With dead ends: 2469 [2023-11-29 02:19:48,413 INFO L226 Difference]: Without dead ends: 2469 [2023-11-29 02:19:48,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 02:19:48,414 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 1109 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 11196 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 5248 SdHoareTripleChecker+Invalid, 11215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 11196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:19:48,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 5248 Invalid, 11215 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 11196 Invalid, 0 Unknown, 0 Unchecked, 25.6s Time] [2023-11-29 02:19:48,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2469 states. [2023-11-29 02:19:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2469 to 2115. [2023-11-29 02:19:48,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2115 states, 1502 states have (on average 1.8462050599201065) internal successors, (2773), 2095 states have internal predecessors, (2773), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:19:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2808 transitions. [2023-11-29 02:19:48,439 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2808 transitions. Word has length 106 [2023-11-29 02:19:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:19:48,439 INFO L495 AbstractCegarLoop]: Abstraction has 2115 states and 2808 transitions. [2023-11-29 02:19:48,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.75) internal successors, (117), 15 states have internal predecessors, (117), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:19:48,439 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2808 transitions. [2023-11-29 02:19:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:19:48,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:19:48,441 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:19:48,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-11-29 02:19:48,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Ended with exit code 0 [2023-11-29 02:19:48,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:19:48,842 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:19:48,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:19:48,842 INFO L85 PathProgramCache]: Analyzing trace with hash 119071821, now seen corresponding path program 1 times [2023-11-29 02:19:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:19:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642740100] [2023-11-29 02:19:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:48,843 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:19:48,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:19:48,844 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:19:48,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Waiting until timeout for monitored process [2023-11-29 02:19:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:19:49,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 02:19:49,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:19:49,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:19:50,077 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:19:50,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:19:50,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:19:50,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:19:51,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:19:51,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:19:51,249 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:19:51,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:19:51,337 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:19:51,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:19:51,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 33 treesize of output 15 [2023-11-29 02:19:51,406 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:19:51,406 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:19:51,479 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5525 (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_5525) |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 02:19:51,493 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:19:51,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5524))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:19:51,529 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (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_5524))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:19:51,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5571 (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_5571))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5524)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5525)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:19:51,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:19:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642740100] [2023-11-29 02:19:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642740100] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:19:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [261809620] [2023-11-29 02:19:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:19:51,968 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:19:51,968 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:19:51,969 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:19:51,970 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-11-29 02:20:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:20:08,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 02:20:08,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:20:08,299 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:20:08,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:20:08,721 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:20:08,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:20:08,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:20:09,401 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:20:09,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:20:09,600 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:20:09,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:20:09,718 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:20:09,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:20:09,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:20:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:20:09,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:20:09,804 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5992 (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~mem36#1.base| v_ArrVal_5992) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 02:20:09,816 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5992 (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_5992) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:20:09,831 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (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~mem35#1.base| v_ArrVal_5991))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:20:09,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (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 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5991))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:20:10,286 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 02:20:10,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-11-29 02:20:10,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5991 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5992 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6038))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5991)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5992)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:20:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [261809620] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:20:10,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:20:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2023-11-29 02:20:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075096946] [2023-11-29 02:20:10,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:20:10,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 02:20:10,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:20:10,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 02:20:10,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=534, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 02:20:10,316 INFO L87 Difference]: Start difference. First operand 2115 states and 2808 transitions. Second operand has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:20:44,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:20:44,373 INFO L93 Difference]: Finished difference Result 2967 states and 3434 transitions. [2023-11-29 02:20:44,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 02:20:44,374 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 02:20:44,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:20:44,378 INFO L225 Difference]: With dead ends: 2967 [2023-11-29 02:20:44,378 INFO L226 Difference]: Without dead ends: 2967 [2023-11-29 02:20:44,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=229, Invalid=1361, Unknown=10, NotChecked=850, Total=2450 [2023-11-29 02:20:44,380 INFO L413 NwaCegarLoop]: 1007 mSDtfsCounter, 1882 mSDsluCounter, 11856 mSDsCounter, 0 mSdLazyCounter, 15836 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1896 SdHoareTripleChecker+Valid, 12863 SdHoareTripleChecker+Invalid, 15879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 15836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:20:44,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1896 Valid, 12863 Invalid, 15879 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [43 Valid, 15836 Invalid, 0 Unknown, 0 Unchecked, 33.1s Time] [2023-11-29 02:20:44,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2967 states. [2023-11-29 02:20:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2967 to 2114. [2023-11-29 02:20:44,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 1502 states have (on average 1.8442077230359522) internal successors, (2770), 2094 states have internal predecessors, (2770), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:20:44,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2805 transitions. [2023-11-29 02:20:44,414 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2805 transitions. Word has length 108 [2023-11-29 02:20:44,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:20:44,415 INFO L495 AbstractCegarLoop]: Abstraction has 2114 states and 2805 transitions. [2023-11-29 02:20:44,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.4) internal successors, (128), 22 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:20:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2805 transitions. [2023-11-29 02:20:44,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 02:20:44,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:20:44,416 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:20:44,429 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Ended with exit code 0 [2023-11-29 02:20:44,639 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-11-29 02:20:44,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:20:44,817 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:20:44,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:20:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash 119071822, now seen corresponding path program 1 times [2023-11-29 02:20:44,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:20:44,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902003512] [2023-11-29 02:20:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:20:44,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:20:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:20:44,819 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:20:44,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 02:20:45,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:20:45,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 02:20:45,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:20:45,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:20:45,915 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:20:45,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:20:45,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:20:45,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:20:45,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:20:46,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:20:46,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:20:46,661 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:20:46,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:20:46,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:20:46,776 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:20:46,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:20:46,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:20:46,863 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:20:46,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:20:46,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:20:46,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:20:46,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:20:46,922 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:20:46,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:20:47,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (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_6507) |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~mem36#1.base| v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2023-11-29 02:20:47,130 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_6507 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_6507) |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_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:20:47,180 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6505))) (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_6506) .cse0 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (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_6506) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6507) |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 02:20:47,228 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_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6505))) (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_6506) .cse1 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_6506) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6507) |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 02:20:48,712 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6600 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6600))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_6505))) (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_6599) .cse0 v_ArrVal_6506) .cse1 v_ArrVal_6507) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6508) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_6507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6505 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6600 (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_6600))) (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_6599) .cse6 v_ArrVal_6506) (select (select (store .cse7 .cse6 v_ArrVal_6505) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6507))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 02:20:48,728 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:20:48,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902003512] [2023-11-29 02:20:48,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902003512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:20:48,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364276344] [2023-11-29 02:20:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:20:48,728 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:20:48,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:20:48,729 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:20:48,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-11-29 02:21:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:06,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 02:21:06,192 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:21:06,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:21:06,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:21:06,519 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:21:06,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:21:06,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:21:06,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:21:06,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:21:06,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:21:07,404 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:21:07,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:21:07,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:21:07,603 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:21:07,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:21:07,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:21:07,757 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:21:07,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:21:07,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:21:07,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:21:07,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:21:07,810 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:21:07,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:21:07,868 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7069 (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_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (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_7069) |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_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:21:07,904 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_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7069) |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_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:21:08,845 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_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7068) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7067))) (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_7068) .cse3 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:21:10,339 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7162))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7067))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7161) .cse0 v_ArrVal_7068) .cse1 v_ArrVal_7069) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7161 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7068 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7069 (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_7162))) (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_7161) .cse6 v_ArrVal_7068) (select (select (store .cse7 .cse6 v_ArrVal_7067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7069))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2023-11-29 02:21:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1364276344] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:21:10,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:21:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 02:21:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80934276] [2023-11-29 02:21:10,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:21:10,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:21:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:21:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:21:10,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=310, Unknown=24, NotChecked=396, Total=812 [2023-11-29 02:21:10,360 INFO L87 Difference]: Start difference. First operand 2114 states and 2805 transitions. Second operand has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:21:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:21:30,262 INFO L93 Difference]: Finished difference Result 2467 states and 3125 transitions. [2023-11-29 02:21:30,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:21:30,263 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 02:21:30,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:21:30,268 INFO L225 Difference]: With dead ends: 2467 [2023-11-29 02:21:30,268 INFO L226 Difference]: Without dead ends: 2467 [2023-11-29 02:21:30,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=136, Invalid=523, Unknown=27, NotChecked=504, Total=1190 [2023-11-29 02:21:30,269 INFO L413 NwaCegarLoop]: 824 mSDtfsCounter, 1586 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 7740 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1594 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 7768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 7740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:21:30,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1594 Valid, 3643 Invalid, 7768 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 7740 Invalid, 0 Unknown, 0 Unchecked, 19.2s Time] [2023-11-29 02:21:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states. [2023-11-29 02:21:30,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2113. [2023-11-29 02:21:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2113 states, 1502 states have (on average 1.8422103861517976) internal successors, (2767), 2093 states have internal predecessors, (2767), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:21:30,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2802 transitions. [2023-11-29 02:21:30,294 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2802 transitions. Word has length 108 [2023-11-29 02:21:30,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:21:30,294 INFO L495 AbstractCegarLoop]: Abstraction has 2113 states and 2802 transitions. [2023-11-29 02:21:30,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.642857142857142) internal successors, (121), 17 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:21:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2802 transitions. [2023-11-29 02:21:30,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:21:30,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:21:30,295 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:21:30,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 02:21:30,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-11-29 02:21:30,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:21:30,696 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:21:30,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:21:30,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1534037820, now seen corresponding path program 1 times [2023-11-29 02:21:30,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:21:30,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [656986068] [2023-11-29 02:21:30,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:30,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:21:30,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:21:30,698 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:21:30,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (33)] Waiting until timeout for monitored process [2023-11-29 02:21:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:32,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 02:21:32,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:21:32,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:21:32,182 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:21:32,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:21:32,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:21:32,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:21:33,185 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:21:33,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:21:33,297 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:21:33,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:21:33,394 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:21:33,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:21:33,488 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:21:33,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:21:33,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:21:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:21:33,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:21:33,617 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7600 (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_7600) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:21:37,699 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (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_7599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:21:37,715 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (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_7599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:21:37,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (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_7598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:21:37,758 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (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_7598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:21:38,237 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7598 (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_7646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7600)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:21:38,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:21:38,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [656986068] [2023-11-29 02:21:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [656986068] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:21:38,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [779917519] [2023-11-29 02:21:38,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:21:38,243 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:21:38,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:21:38,244 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:21:38,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 02:21:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:21:59,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 02:21:59,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:21:59,693 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:21:59,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:22:00,170 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:22:00,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:22:00,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:22:01,003 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:22:01,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:22:01,232 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:22:01,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:22:01,376 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:22:01,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:22:01,525 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:22:01,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:22:01,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:22:01,601 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:22:01,601 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:22:01,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (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_8083) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:22:01,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (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_8082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:22:01,942 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (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_8082))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:22:01,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (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_8081))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:22:01,993 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (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_8081))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:22:02,528 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 02:22:02,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-11-29 02:22:02,547 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8129 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8129))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8081)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8082)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:22:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [779917519] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:22:02,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:22:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2023-11-29 02:22:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476348726] [2023-11-29 02:22:02,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:22:02,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 02:22:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:22:02,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 02:22:02,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=713, Unknown=21, NotChecked=780, Total=1640 [2023-11-29 02:22:02,554 INFO L87 Difference]: Start difference. First operand 2113 states and 2802 transitions. Second operand has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:22:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:22:44,989 INFO L93 Difference]: Finished difference Result 2963 states and 3428 transitions. [2023-11-29 02:22:44,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 02:22:44,990 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 02:22:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:22:44,995 INFO L225 Difference]: With dead ends: 2963 [2023-11-29 02:22:44,995 INFO L226 Difference]: Without dead ends: 2963 [2023-11-29 02:22:44,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=280, Invalid=1727, Unknown=21, NotChecked=1164, Total=3192 [2023-11-29 02:22:44,997 INFO L413 NwaCegarLoop]: 1006 mSDtfsCounter, 1870 mSDsluCounter, 13587 mSDsCounter, 0 mSdLazyCounter, 18278 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1884 SdHoareTripleChecker+Valid, 14593 SdHoareTripleChecker+Invalid, 18319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 18278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:22:44,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1884 Valid, 14593 Invalid, 18319 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [41 Valid, 18278 Invalid, 0 Unknown, 0 Unchecked, 41.1s Time] [2023-11-29 02:22:45,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2023-11-29 02:22:45,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2112. [2023-11-29 02:22:45,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2112 states, 1502 states have (on average 1.8402130492676432) internal successors, (2764), 2092 states have internal predecessors, (2764), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:22:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2112 states to 2112 states and 2799 transitions. [2023-11-29 02:22:45,022 INFO L78 Accepts]: Start accepts. Automaton has 2112 states and 2799 transitions. Word has length 110 [2023-11-29 02:22:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:22:45,023 INFO L495 AbstractCegarLoop]: Abstraction has 2112 states and 2799 transitions. [2023-11-29 02:22:45,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.0) internal successors, (132), 24 states have internal predecessors, (132), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:22:45,023 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 2799 transitions. [2023-11-29 02:22:45,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:22:45,024 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:22:45,024 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:22:45,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (33)] Ended with exit code 0 [2023-11-29 02:22:45,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 02:22:45,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:22:45,425 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:22:45,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:22:45,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1534037819, now seen corresponding path program 1 times [2023-11-29 02:22:45,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:22:45,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033197569] [2023-11-29 02:22:45,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:45,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:22:45,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:22:45,427 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:22:45,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Waiting until timeout for monitored process [2023-11-29 02:22:47,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:22:47,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 02:22:47,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:22:47,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:22:47,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:22:47,169 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:22:47,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:22:47,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 19 treesize of output 1 [2023-11-29 02:22:47,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 02:22:47,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:22:47,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:22:48,033 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:22:48,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:22:48,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:22:48,179 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:22:48,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:22:48,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:22:48,300 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:22:48,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:22:48,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:22:48,431 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:22:48,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:22:48,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:22:48,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 31 treesize of output 13 [2023-11-29 02:22:48,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:22:48,502 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:22:48,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:22:48,712 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (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_8615) |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_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8615 (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_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 02:22:48,753 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_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_8615) |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_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:22:48,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8613) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8614) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8614))) (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~mem36#1.base| v_ArrVal_8613) .cse2 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:22:48,922 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_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8614))) (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_8613) .cse1 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_8613) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8614) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 02:22:51,045 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8611))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8612) .cse1 v_ArrVal_8613) (select (select (store .cse2 .cse1 v_ArrVal_8614) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8615))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8611))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_8614))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8612) .cse4 v_ArrVal_8613) .cse5 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:22:51,303 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_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8611))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8614))) (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_8612) .cse1 v_ArrVal_8613) .cse2 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_8611))) (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_8612) .cse7 v_ArrVal_8613) (select (select (store .cse8 .cse7 v_ArrVal_8614) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8615))) |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 02:22:57,498 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8708))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8611))) (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~mem33#1.base| v_ArrVal_8707) .cse1 v_ArrVal_8612) .cse2 v_ArrVal_8613) (select (select (store .cse3 .cse2 v_ArrVal_8614) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8615))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8708 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8707 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8612 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8611 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8708))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8611))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8614))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8707) .cse6 v_ArrVal_8612) .cse7 v_ArrVal_8613) .cse8 v_ArrVal_8615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8616) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 02:22:57,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:22:57,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033197569] [2023-11-29 02:22:57,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033197569] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:22:57,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1717140259] [2023-11-29 02:22:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:22:57,542 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:22:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:22:57,543 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:22:57,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-11-29 02:23:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:23:22,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 02:23:22,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:23:22,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:23:25,426 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:23:25,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 02:23:25,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:23:25,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:23:26,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 02:23:27,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:23:27,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:23:32,422 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:23:32,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:23:32,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:23:33,764 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:23:33,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:23:33,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:23:34,640 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:23:34,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:23:34,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:23:35,555 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:23:35,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:23:35,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:23:35,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:23:35,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:23:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:23:35,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:23:36,019 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (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_9194) |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_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9194 (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_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 02:23:36,139 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_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2023-11-29 02:23:36,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9193) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9192) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9192))) (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~mem36#1.base| v_ArrVal_9193) .cse2 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:23:36,507 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_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9192))) (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_9193) .cse1 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9193) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9192) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9194) |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 02:23:37,951 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9191))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9192))) (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_9190) .cse0 v_ArrVal_9193) .cse1 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (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_9191))) (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_9190) .cse6 v_ArrVal_9193) (select (select (store .cse7 .cse6 v_ArrVal_9192) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9194))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 02:23:38,459 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_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9191))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9192))) (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_9190) .cse1 v_ArrVal_9193) .cse2 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9191))) (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_9190) .cse7 v_ArrVal_9193) (select (select (store .cse8 .cse7 v_ArrVal_9192) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9194))) |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 02:23:46,707 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9286))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9191))) (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~mem33#1.base| v_ArrVal_9287) .cse1 v_ArrVal_9190) .cse2 v_ArrVal_9193) (select (select (store .cse3 .cse2 v_ArrVal_9192) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9194))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9195 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9194 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9193 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9286))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9191))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9192))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9287) .cse6 v_ArrVal_9190) .cse7 v_ArrVal_9193) .cse8 v_ArrVal_9194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9195) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 02:23:46,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1717140259] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:23:46,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:23:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 02:23:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216821412] [2023-11-29 02:23:46,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:23:46,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 02:23:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:23:46,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 02:23:46,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 02:23:46,741 INFO L87 Difference]: Start difference. First operand 2112 states and 2799 transitions. Second operand has 19 states, 16 states have (on average 7.8125) internal successors, (125), 19 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:25:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:25:40,382 INFO L93 Difference]: Finished difference Result 2465 states and 3119 transitions. [2023-11-29 02:25:40,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:25:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.8125) internal successors, (125), 19 states have internal predecessors, (125), 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 110 [2023-11-29 02:25:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:25:40,387 INFO L225 Difference]: With dead ends: 2465 [2023-11-29 02:25:40,387 INFO L226 Difference]: Without dead ends: 2465 [2023-11-29 02:25:40,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 02:25:40,388 INFO L413 NwaCegarLoop]: 774 mSDtfsCounter, 1706 mSDsluCounter, 2716 mSDsCounter, 0 mSdLazyCounter, 7003 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 107.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 7035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 110.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:25:40,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 3490 Invalid, 7035 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 7003 Invalid, 0 Unknown, 0 Unchecked, 110.9s Time] [2023-11-29 02:25:40,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2023-11-29 02:25:40,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2111. [2023-11-29 02:25:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1502 states have (on average 1.8382157123834886) internal successors, (2761), 2091 states have internal predecessors, (2761), 15 states have call successors, (15), 6 states have call predecessors, (15), 8 states have return successors, (20), 13 states have call predecessors, (20), 15 states have call successors, (20) [2023-11-29 02:25:40,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2796 transitions. [2023-11-29 02:25:40,415 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2796 transitions. Word has length 110 [2023-11-29 02:25:40,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:25:40,415 INFO L495 AbstractCegarLoop]: Abstraction has 2111 states and 2796 transitions. [2023-11-29 02:25:40,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.8125) internal successors, (125), 19 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:25:40,415 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2796 transitions. [2023-11-29 02:25:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 02:25:40,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:25:40,416 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, 1] [2023-11-29 02:25:40,430 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:25:40,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2023-11-29 02:25:40,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:25:40,817 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 848 more)] === [2023-11-29 02:25:40,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:25:40,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1034443029, now seen corresponding path program 1 times [2023-11-29 02:25:40,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:25:40,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820712862] [2023-11-29 02:25:40,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:25:40,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:25:40,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:25:40,819 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 02:25:40,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/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 (37)] Waiting until timeout for monitored process [2023-11-29 02:25:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:25:42,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 02:25:42,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:25:42,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:25:43,861 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:25:43,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 02:25:44,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:25:44,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 02:25:51,645 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:25:51,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:25:52,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:25:52,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:25:53,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:25:53,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:25:53,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:25:53,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 44 treesize of output 43 [2023-11-29 02:25:54,687 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:25:54,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:25:54,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 02:25:55,117 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 02:25:55,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 02:25:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:25:55,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:25:56,336 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (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)) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9743) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:25:56,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (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_9743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:25:56,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9742))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:25:56,557 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9742))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:25:56,637 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9741 (Array (_ BitVec 32) (_ 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 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9741))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:25:56,719 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9741 (Array (_ BitVec 32) (_ 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 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9741))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:25:56,803 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9740 (Array (_ BitVec 32) (_ 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| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9740))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9741)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:25:56,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9740 (Array (_ BitVec 32) (_ 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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9740))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9741)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:25:58,764 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9790 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9743 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9740 (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_9790))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9740)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9741)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9742)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9743)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:25:58,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:25:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820712862] [2023-11-29 02:25:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820712862] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:25:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [999059690] [2023-11-29 02:25:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:25:58,785 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:25:58,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:25:58,786 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:25:58,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f6899e5-4ecf-4ce7-bcd3-cad5980939d6/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-11-29 02:26:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:26:12,386 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 02:26:12,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:26:12,919 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:26:12,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:26:17,230 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:26:17,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 02:26:17,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:26:23,431 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:26:23,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:26:25,023 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:26:25,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:26:25,998 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:26:25,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:26:26,998 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:26:26,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:26:28,025 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:26:28,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:26:28,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:26:28,426 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 02:26:28,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 02:26:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 02:26:29,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:26:33,941 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ 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_10246) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10245) |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 02:26:34,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ 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_10246) (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_10245) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 02:26:34,174 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ BitVec 1)) (v_ArrVal_10244 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10246) (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_10244))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))))) is different from false [2023-11-29 02:26:34,280 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ BitVec 1)) (v_ArrVal_10244 (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_10246) (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_10244))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 02:26:34,389 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ BitVec 1)) (v_ArrVal_10243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10244 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10246) (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_10243))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10244)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 02:26:34,501 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ BitVec 1)) (v_ArrVal_10243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10244 (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_10246) (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_10243))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10244)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 02:26:34,619 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10242 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ BitVec 1)) (v_ArrVal_10243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10244 (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_10246) (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_10242))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10243)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10244)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 02:26:34,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10242 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10246 (_ BitVec 1)) (v_ArrVal_10243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10244 (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_10246) (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_10242))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10243)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10244)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 02:26:37,081 INFO L349 Elim1Store]: treesize reduction 207, result has 49.4 percent of original size [2023-11-29 02:26:37,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 603 treesize of output 609 [2023-11-29 02:26:37,203 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10243 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10244 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10292 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10292))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10242)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10243)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10244)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10245)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:26:37,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [999059690] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:26:37,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:26:37,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 26 [2023-11-29 02:26:37,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421272197] [2023-11-29 02:26:37,221 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:26:37,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 02:26:37,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:26:37,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 02:26:37,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=777, Unknown=19, NotChecked=1314, Total=2256 [2023-11-29 02:26:37,223 INFO L87 Difference]: Start difference. First operand 2111 states and 2796 transitions. Second operand has 27 states, 24 states have (on average 5.666666666666667) internal successors, (136), 26 states have internal predecessors, (136), 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)