./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:19:30,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:19:30,391 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 06:19:30,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:19:30,397 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:19:30,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:19:30,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:19:30,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:19:30,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:19:30,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:19:30,424 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:19:30,425 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:19:30,425 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:19:30,426 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 06:19:30,426 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:19:30,427 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:19:30,427 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 06:19:30,428 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 06:19:30,428 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:19:30,429 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 06:19:30,429 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 06:19:30,430 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 06:19:30,430 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:19:30,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:19:30,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:19:30,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:19:30,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:19:30,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:19:30,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:19:30,433 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:19:30,434 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:19:30,434 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:19:30,434 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:19:30,435 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:19:30,435 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:19:30,436 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:19:30,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:19:30,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:19:30,437 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:19:30,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:19:30,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:19:30,438 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:19:30,438 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:19:30,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:19:30,439 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 06:19:30,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:19:30,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:19:30,440 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:19:30,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:19:30,441 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/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_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 [2024-11-09 06:19:30,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:19:30,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:19:30,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:19:30,765 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:19:30,766 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:19:30,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i Unable to find full path for "g++" [2024-11-09 06:19:32,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:19:33,074 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:19:33,075 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2024-11-09 06:19:33,099 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data/5a98c8df6/2dda8ed66e32401096611e988baee0a5/FLAG845696c11 [2024-11-09 06:19:33,120 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data/5a98c8df6/2dda8ed66e32401096611e988baee0a5 [2024-11-09 06:19:33,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:19:33,124 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:19:33,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:19:33,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:19:33,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:19:33,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:19:33" (1/1) ... [2024-11-09 06:19:33,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78030ec6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:33, skipping insertion in model container [2024-11-09 06:19:33,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:19:33" (1/1) ... [2024-11-09 06:19:33,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:19:33,714 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,775 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,787 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,795 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,856 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,856 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,864 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,867 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,870 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,874 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,877 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,878 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:33,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:19:33,910 ERROR L321 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) [2024-11-09 06:19:33,911 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@69efd2e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:33, skipping insertion in model container [2024-11-09 06:19:33,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:19:33,912 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 06:19:33,914 INFO L158 Benchmark]: Toolchain (without parser) took 789.20ms. Allocated memory is still 134.2MB. Free memory was 93.3MB in the beginning and 70.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 06:19:33,915 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 134.2MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:19:33,916 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.41ms. Allocated memory is still 134.2MB. Free memory was 93.3MB in the beginning and 70.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 06:19:33,917 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.31ms. Allocated memory is still 134.2MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.41ms. Allocated memory is still 134.2MB. Free memory was 93.3MB in the beginning and 70.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 778]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 06:19:36,143 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:19:36,224 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-09 06:19:36,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:19:36,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:19:36,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:19:36,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:19:36,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:19:36,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:19:36,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:19:36,261 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 06:19:36,261 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 06:19:36,262 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 06:19:36,262 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 06:19:36,262 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 06:19:36,263 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 06:19:36,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:19:36,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:19:36,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:19:36,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:19:36,267 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:19:36,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:19:36,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:19:36,272 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 06:19:36,272 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 06:19:36,273 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 06:19:36,273 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:19:36,273 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 06:19:36,274 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 06:19:36,274 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:19:36,274 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 06:19:36,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:19:36,275 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:19:36,275 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:19:36,275 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:19:36,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:19:36,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 06:19:36,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:19:36,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:19:36,276 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:19:36,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:19:36,280 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-09 06:19:36,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 06:19:36,281 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:19:36,281 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 06:19:36,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/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_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje 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 -> Taipan 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 -> b6c6a722152c52daf4f5e799c877f12032a99023b4a9ea1a935c1ce634969e85 [2024-11-09 06:19:36,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:19:36,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:19:36,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:19:36,711 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:19:36,711 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:19:36,713 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i Unable to find full path for "g++" [2024-11-09 06:19:38,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:19:39,144 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:19:39,145 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test8-1.i [2024-11-09 06:19:39,173 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data/17708f5a8/6bfe729b9ac34b6aa79d0b9126cc63db/FLAG5af29cf1e [2024-11-09 06:19:39,379 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/data/17708f5a8/6bfe729b9ac34b6aa79d0b9126cc63db [2024-11-09 06:19:39,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:19:39,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:19:39,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:19:39,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:19:39,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:19:39,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:19:39" (1/1) ... [2024-11-09 06:19:39,396 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@784b033e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:39, skipping insertion in model container [2024-11-09 06:19:39,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:19:39" (1/1) ... [2024-11-09 06:19:39,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:19:40,115 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,169 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,176 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,185 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,196 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,268 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,270 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,275 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,280 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,283 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,288 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,289 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,293 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:19:40,335 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 06:19:40,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:19:40,402 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,425 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,431 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,439 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,448 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,482 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,483 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,489 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,490 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,492 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,494 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,496 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,497 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 06:19:40,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:19:40,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:19:40,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:19:40,695 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:19:40,696 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40 WrapperNode [2024-11-09 06:19:40,697 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:19:40,698 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:19:40,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:19:40,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:19:40,707 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,819 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1003 [2024-11-09 06:19:40,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:19:40,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:19:40,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:19:40,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:19:40,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,840 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,889 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,909 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,943 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:19:40,944 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:19:40,944 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:19:40,944 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:19:40,945 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (1/1) ... [2024-11-09 06:19:40,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 06:19:40,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:19:41,000 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 06:19:41,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 06:19:41,045 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 06:19:41,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 06:19:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2024-11-09 06:19:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-11-09 06:19:41,046 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 06:19:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 06:19:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2024-11-09 06:19:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2024-11-09 06:19:41,048 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-09 06:19:41,048 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-09 06:19:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 06:19:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:19:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 06:19:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 06:19:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 06:19:41,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 06:19:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-11-09 06:19:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-09 06:19:41,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:19:41,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:19:41,340 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:19:41,342 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:19:41,369 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 06:19:46,448 INFO L? ?]: Removed 1095 outVars from TransFormulas that were not future-live. [2024-11-09 06:19:46,448 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:19:46,477 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:19:46,478 INFO L316 CfgBuilder]: Removed 58 assume(true) statements. [2024-11-09 06:19:46,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:19:46 BoogieIcfgContainer [2024-11-09 06:19:46,478 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:19:46,480 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:19:46,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:19:46,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:19:46,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:19:39" (1/3) ... [2024-11-09 06:19:46,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ce529f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:19:46, skipping insertion in model container [2024-11-09 06:19:46,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:19:40" (2/3) ... [2024-11-09 06:19:46,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ce529f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:19:46, skipping insertion in model container [2024-11-09 06:19:46,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:19:46" (3/3) ... [2024-11-09 06:19:46,490 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test8-1.i [2024-11-09 06:19:46,514 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:19:46,515 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-11-09 06:19:46,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:19:46,606 INFO L333 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, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@7d053bf0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:19:46,606 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-11-09 06:19:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 1103 states, 550 states have (on average 2.2054545454545456) internal successors, (1213), 1093 states have internal predecessors, (1213), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 06:19:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:19:46,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:46,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:19:46,622 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:19:46,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 141073, now seen corresponding path program 1 times [2024-11-09 06:19:46,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:46,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669077527] [2024-11-09 06:19:46,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:46,641 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 [2024-11-09 06:19:46,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:46,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:19:46,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:46,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:19:46,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:46,849 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 [2024-11-09 06:19:46,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:46,864 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:19:46,865 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:46,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669077527] [2024-11-09 06:19:46,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669077527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:19:46,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:19:46,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:19:46,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901282243] [2024-11-09 06:19:46,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:19:46,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:19:46,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:19:46,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:19:46,905 INFO L87 Difference]: Start difference. First operand has 1103 states, 550 states have (on average 2.2054545454545456) internal successors, (1213), 1093 states have internal predecessors, (1213), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2024-11-09 06:19:48,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:48,966 INFO L93 Difference]: Finished difference Result 1106 states and 1197 transitions. [2024-11-09 06:19:48,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:19:48,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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 [2024-11-09 06:19:48,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:48,987 INFO L225 Difference]: With dead ends: 1106 [2024-11-09 06:19:48,987 INFO L226 Difference]: Without dead ends: 1104 [2024-11-09 06:19:48,989 INFO L431 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 [2024-11-09 06:19:48,993 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 968 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:48,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 842 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 06:19:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2024-11-09 06:19:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1092. [2024-11-09 06:19:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 555 states have (on average 2.0594594594594593) internal successors, (1143), 1081 states have internal predecessors, (1143), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 06:19:49,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1187 transitions. [2024-11-09 06:19:49,095 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1187 transitions. Word has length 3 [2024-11-09 06:19:49,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:49,096 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1187 transitions. [2024-11-09 06:19:49,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2024-11-09 06:19:49,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1187 transitions. [2024-11-09 06:19:49,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 06:19:49,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:49,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 06:19:49,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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)] Ended with exit code 0 [2024-11-09 06:19:49,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:19:49,300 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:19:49,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:49,301 INFO L85 PathProgramCache]: Analyzing trace with hash 141074, now seen corresponding path program 1 times [2024-11-09 06:19:49,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:49,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261758774] [2024-11-09 06:19:49,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:49,302 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 [2024-11-09 06:19:49,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:49,305 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:19:49,307 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:49,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:19:49,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:49,423 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 [2024-11-09 06:19:49,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:49,441 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:19:49,442 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:49,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261758774] [2024-11-09 06:19:49,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261758774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:19:49,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:19:49,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:19:49,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979282754] [2024-11-09 06:19:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:19:49,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:19:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:49,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:19:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:19:49,447 INFO L87 Difference]: Start difference. First operand 1092 states and 1187 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2024-11-09 06:19:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:52,501 INFO L93 Difference]: Finished difference Result 1495 states and 1624 transitions. [2024-11-09 06:19:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:19:52,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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 [2024-11-09 06:19:52,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:52,509 INFO L225 Difference]: With dead ends: 1495 [2024-11-09 06:19:52,509 INFO L226 Difference]: Without dead ends: 1495 [2024-11-09 06:19:52,509 INFO L431 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 [2024-11-09 06:19:52,511 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 433 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:52,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1626 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 06:19:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-09 06:19:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1306. [2024-11-09 06:19:52,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 769 states have (on average 2.049414824447334) internal successors, (1576), 1294 states have internal predecessors, (1576), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 06:19:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1622 transitions. [2024-11-09 06:19:52,583 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1622 transitions. Word has length 3 [2024-11-09 06:19:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:52,584 INFO L471 AbstractCegarLoop]: Abstraction has 1306 states and 1622 transitions. [2024-11-09 06:19:52,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2024-11-09 06:19:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1622 transitions. [2024-11-09 06:19:52,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 06:19:52,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:52,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:19:52,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:52,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:19:52,787 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:19:52,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:52,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1437667611, now seen corresponding path program 1 times [2024-11-09 06:19:52,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:52,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985290997] [2024-11-09 06:19:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:52,794 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 [2024-11-09 06:19:52,795 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:52,798 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:19:52,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:52,949 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:19:52,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:52,962 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 [2024-11-09 06:19:52,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:19:53,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:19:53,068 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 [2024-11-09 06:19:53,088 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:19:53,089 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 [2024-11-09 06:19:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:53,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:19:53,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985290997] [2024-11-09 06:19:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985290997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:19:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:19:53,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:19:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50226042] [2024-11-09 06:19:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:19:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:19:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:53,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:19:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:19:53,122 INFO L87 Difference]: Start difference. First operand 1306 states and 1622 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:19:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:56,074 INFO L93 Difference]: Finished difference Result 1312 states and 1626 transitions. [2024-11-09 06:19:56,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:19:56,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 06:19:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:56,081 INFO L225 Difference]: With dead ends: 1312 [2024-11-09 06:19:56,081 INFO L226 Difference]: Without dead ends: 1312 [2024-11-09 06:19:56,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:19:56,083 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1079 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:56,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 615 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-09 06:19:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-09 06:19:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1080. [2024-11-09 06:19:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 555 states have (on average 2.036036036036036) internal successors, (1130), 1069 states have internal predecessors, (1130), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 06:19:56,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1174 transitions. [2024-11-09 06:19:56,118 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1174 transitions. Word has length 7 [2024-11-09 06:19:56,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:56,120 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1174 transitions. [2024-11-09 06:19:56,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:19:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1174 transitions. [2024-11-09 06:19:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:19:56,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:56,121 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:19:56,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:56,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:19:56,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:19:56,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1618023058, now seen corresponding path program 1 times [2024-11-09 06:19:56,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1256756429] [2024-11-09 06:19:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:56,323 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 [2024-11-09 06:19:56,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:56,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:19:56,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:56,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:19:56,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:56,475 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 [2024-11-09 06:19:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:56,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:19:56,496 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:56,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1256756429] [2024-11-09 06:19:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1256756429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:19:56,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:19:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:19:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872661323] [2024-11-09 06:19:56,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:19:56,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:19:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:56,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:19:56,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:19:56,499 INFO L87 Difference]: Start difference. First operand 1080 states and 1174 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2024-11-09 06:19:58,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:19:58,993 INFO L93 Difference]: Finished difference Result 1416 states and 1541 transitions. [2024-11-09 06:19:58,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:19:58,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2024-11-09 06:19:58,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:19:59,000 INFO L225 Difference]: With dead ends: 1416 [2024-11-09 06:19:59,000 INFO L226 Difference]: Without dead ends: 1416 [2024-11-09 06:19:59,001 INFO L431 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 [2024-11-09 06:19:59,001 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 946 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:19:59,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 1334 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 06:19:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-09 06:19:59,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1032. [2024-11-09 06:19:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 555 states have (on average 1.9477477477477478) internal successors, (1081), 1021 states have internal predecessors, (1081), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 06:19:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1125 transitions. [2024-11-09 06:19:59,029 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1125 transitions. Word has length 8 [2024-11-09 06:19:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:19:59,030 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1125 transitions. [2024-11-09 06:19:59,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2024-11-09 06:19:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1125 transitions. [2024-11-09 06:19:59,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 06:19:59,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:19:59,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:19:59,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:59,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:19:59,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:19:59,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:19:59,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1618023059, now seen corresponding path program 1 times [2024-11-09 06:19:59,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:19:59,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258001992] [2024-11-09 06:19:59,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:19:59,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:19:59,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:19:59,236 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:19:59,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:19:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:19:59,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:19:59,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:19:59,384 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 [2024-11-09 06:19:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:19:59,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:19:59,423 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:19:59,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258001992] [2024-11-09 06:19:59,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258001992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:19:59,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:19:59,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:19:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707801532] [2024-11-09 06:19:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:19:59,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:19:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:19:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:19:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:19:59,425 INFO L87 Difference]: Start difference. First operand 1032 states and 1125 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2024-11-09 06:20:02,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:02,451 INFO L93 Difference]: Finished difference Result 1519 states and 1649 transitions. [2024-11-09 06:20:02,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:20:02,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2024-11-09 06:20:02,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:02,456 INFO L225 Difference]: With dead ends: 1519 [2024-11-09 06:20:02,457 INFO L226 Difference]: Without dead ends: 1519 [2024-11-09 06:20:02,457 INFO L431 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 [2024-11-09 06:20:02,458 INFO L432 NwaCegarLoop]: 1224 mSDtfsCounter, 709 mSDsluCounter, 497 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:02,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1721 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 06:20:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1519 states. [2024-11-09 06:20:02,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1519 to 1289. [2024-11-09 06:20:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 820 states have (on average 1.9439024390243902) internal successors, (1594), 1276 states have internal predecessors, (1594), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:02,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1642 transitions. [2024-11-09 06:20:02,489 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1642 transitions. Word has length 8 [2024-11-09 06:20:02,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:02,489 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1642 transitions. [2024-11-09 06:20:02,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2024-11-09 06:20:02,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1642 transitions. [2024-11-09 06:20:02,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 06:20:02,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:02,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:02,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:02,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:02,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:02,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:02,698 INFO L85 PathProgramCache]: Analyzing trace with hash 932312559, now seen corresponding path program 1 times [2024-11-09 06:20:02,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:02,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066033500] [2024-11-09 06:20:02,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:02,699 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 [2024-11-09 06:20:02,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:02,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:02,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:02,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 06:20:02,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:02,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:20:02,907 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:20:02,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 06:20:02,920 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 30 treesize of output 39 [2024-11-09 06:20:03,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 06:20:03,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 06:20:03,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:03,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:03,026 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:03,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066033500] [2024-11-09 06:20:03,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066033500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:03,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:03,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:03,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739946338] [2024-11-09 06:20:03,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:03,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:03,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:03,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:03,028 INFO L87 Difference]: Start difference. First operand 1289 states and 1642 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:04,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:04,607 INFO L93 Difference]: Finished difference Result 1821 states and 2392 transitions. [2024-11-09 06:20:04,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:04,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 06:20:04,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:04,613 INFO L225 Difference]: With dead ends: 1821 [2024-11-09 06:20:04,613 INFO L226 Difference]: Without dead ends: 1821 [2024-11-09 06:20:04,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:04,614 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 368 mSDsluCounter, 1987 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 3035 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:04,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 3035 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 06:20:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2024-11-09 06:20:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1291. [2024-11-09 06:20:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 822 states have (on average 1.9416058394160585) internal successors, (1596), 1278 states have internal predecessors, (1596), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1644 transitions. [2024-11-09 06:20:04,656 INFO L78 Accepts]: Start accepts. Automaton has 1291 states and 1644 transitions. Word has length 10 [2024-11-09 06:20:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:04,657 INFO L471 AbstractCegarLoop]: Abstraction has 1291 states and 1644 transitions. [2024-11-09 06:20:04,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 1644 transitions. [2024-11-09 06:20:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 06:20:04,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:04,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:04,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:04,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:04,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:04,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:04,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1227569708, now seen corresponding path program 1 times [2024-11-09 06:20:04,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:04,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190359774] [2024-11-09 06:20:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:04,861 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 [2024-11-09 06:20:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:04,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:04,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:05,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 06:20:05,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:05,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:05,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:05,056 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:05,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190359774] [2024-11-09 06:20:05,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190359774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:05,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:05,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:20:05,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11484591] [2024-11-09 06:20:05,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:05,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:20:05,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:05,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:20:05,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:20:05,062 INFO L87 Difference]: Start difference. First operand 1291 states and 1644 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:05,105 INFO L93 Difference]: Finished difference Result 1248 states and 1599 transitions. [2024-11-09 06:20:05,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:20:05,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 06:20:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:05,110 INFO L225 Difference]: With dead ends: 1248 [2024-11-09 06:20:05,111 INFO L226 Difference]: Without dead ends: 1248 [2024-11-09 06:20:05,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:20:05,112 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 71 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2021 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:05,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2021 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:20:05,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-11-09 06:20:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1248. [2024-11-09 06:20:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 803 states have (on average 1.9315068493150684) internal successors, (1551), 1235 states have internal predecessors, (1551), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1599 transitions. [2024-11-09 06:20:05,150 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1599 transitions. Word has length 19 [2024-11-09 06:20:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:05,150 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1599 transitions. [2024-11-09 06:20:05,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:05,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1599 transitions. [2024-11-09 06:20:05,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 06:20:05,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:05,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:05,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:05,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:05,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:05,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:05,354 INFO L85 PathProgramCache]: Analyzing trace with hash -598262016, now seen corresponding path program 1 times [2024-11-09 06:20:05,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:05,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409122981] [2024-11-09 06:20:05,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:05,355 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 [2024-11-09 06:20:05,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:05,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:05,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:05,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:20:05,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:05,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:05,568 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:05,568 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:05,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409122981] [2024-11-09 06:20:05,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409122981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:05,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:05,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:05,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331136129] [2024-11-09 06:20:05,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:05,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:05,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:05,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:05,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:05,570 INFO L87 Difference]: Start difference. First operand 1248 states and 1599 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:05,668 INFO L93 Difference]: Finished difference Result 1226 states and 1570 transitions. [2024-11-09 06:20:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:20:05,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2024-11-09 06:20:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:05,673 INFO L225 Difference]: With dead ends: 1226 [2024-11-09 06:20:05,673 INFO L226 Difference]: Without dead ends: 1226 [2024-11-09 06:20:05,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:05,674 INFO L432 NwaCegarLoop]: 997 mSDtfsCounter, 48 mSDsluCounter, 1968 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:05,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2965 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:20:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-09 06:20:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1226. [2024-11-09 06:20:05,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 795 states have (on average 1.9144654088050315) internal successors, (1522), 1213 states have internal predecessors, (1522), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1570 transitions. [2024-11-09 06:20:05,699 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1570 transitions. Word has length 20 [2024-11-09 06:20:05,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:05,699 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1570 transitions. [2024-11-09 06:20:05,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1570 transitions. [2024-11-09 06:20:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:20:05,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:05,701 INFO L215 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] [2024-11-09 06:20:05,708 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:05,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:05,905 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:05,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:05,906 INFO L85 PathProgramCache]: Analyzing trace with hash 910076078, now seen corresponding path program 1 times [2024-11-09 06:20:05,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:05,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [481891168] [2024-11-09 06:20:05,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:05,906 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 [2024-11-09 06:20:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:05,907 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:05,909 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:06,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:20:06,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:06,115 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 [2024-11-09 06:20:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:06,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:06,232 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:06,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [481891168] [2024-11-09 06:20:06,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [481891168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:06,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:06,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:20:06,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435518013] [2024-11-09 06:20:06,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:06,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:06,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:06,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:06,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:06,234 INFO L87 Difference]: Start difference. First operand 1226 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:08,473 INFO L93 Difference]: Finished difference Result 1239 states and 1586 transitions. [2024-11-09 06:20:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:08,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-09 06:20:08,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:08,478 INFO L225 Difference]: With dead ends: 1239 [2024-11-09 06:20:08,478 INFO L226 Difference]: Without dead ends: 1239 [2024-11-09 06:20:08,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:08,479 INFO L432 NwaCegarLoop]: 569 mSDtfsCounter, 877 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:08,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1164 Invalid, 1009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 06:20:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-11-09 06:20:08,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 1222. [2024-11-09 06:20:08,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 795 states have (on average 1.909433962264151) internal successors, (1518), 1209 states have internal predecessors, (1518), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1566 transitions. [2024-11-09 06:20:08,504 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1566 transitions. Word has length 34 [2024-11-09 06:20:08,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:08,504 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1566 transitions. [2024-11-09 06:20:08,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1566 transitions. [2024-11-09 06:20:08,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 06:20:08,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:08,506 INFO L215 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] [2024-11-09 06:20:08,511 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:08,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:08,710 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:08,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:08,710 INFO L85 PathProgramCache]: Analyzing trace with hash 910076079, now seen corresponding path program 1 times [2024-11-09 06:20:08,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:08,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277605193] [2024-11-09 06:20:08,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:08,711 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 [2024-11-09 06:20:08,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:08,712 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:08,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:08,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 06:20:08,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:08,937 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 [2024-11-09 06:20:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:09,214 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:09,214 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:09,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277605193] [2024-11-09 06:20:09,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277605193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:09,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:09,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:20:09,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013025970] [2024-11-09 06:20:09,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:09,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:09,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:09,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:09,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:09,216 INFO L87 Difference]: Start difference. First operand 1222 states and 1566 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:12,958 INFO L93 Difference]: Finished difference Result 1452 states and 1573 transitions. [2024-11-09 06:20:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:12,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2024-11-09 06:20:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:12,963 INFO L225 Difference]: With dead ends: 1452 [2024-11-09 06:20:12,963 INFO L226 Difference]: Without dead ends: 1452 [2024-11-09 06:20:12,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:12,964 INFO L432 NwaCegarLoop]: 742 mSDtfsCounter, 636 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 1146 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:12,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1759 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1146 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 06:20:12,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-09 06:20:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1218. [2024-11-09 06:20:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 795 states have (on average 1.9044025157232705) internal successors, (1514), 1205 states have internal predecessors, (1514), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:12,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1562 transitions. [2024-11-09 06:20:12,988 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1562 transitions. Word has length 34 [2024-11-09 06:20:12,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:12,989 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1562 transitions. [2024-11-09 06:20:12,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:12,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1562 transitions. [2024-11-09 06:20:12,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 06:20:12,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:12,991 INFO L215 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] [2024-11-09 06:20:12,997 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:13,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:13,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:13,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:13,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1574491398, now seen corresponding path program 1 times [2024-11-09 06:20:13,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:13,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307591308] [2024-11-09 06:20:13,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:13,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:13,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:13,199 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:13,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:13,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:20:13,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:13,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:13,481 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307591308] [2024-11-09 06:20:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307591308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:13,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:13,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:13,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906137881] [2024-11-09 06:20:13,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:13,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:13,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:13,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:13,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:13,483 INFO L87 Difference]: Start difference. First operand 1218 states and 1562 transitions. Second operand has 4 states, 4 states have (on average 12.5) 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) [2024-11-09 06:20:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:13,571 INFO L93 Difference]: Finished difference Result 1212 states and 1552 transitions. [2024-11-09 06:20:13,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 06:20:13,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) 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 [2024-11-09 06:20:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:13,576 INFO L225 Difference]: With dead ends: 1212 [2024-11-09 06:20:13,577 INFO L226 Difference]: Without dead ends: 1212 [2024-11-09 06:20:13,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:13,578 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 21 mSDsluCounter, 1951 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:13,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2942 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:20:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-09 06:20:13,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-11-09 06:20:13,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 789 states have (on average 1.9062103929024081) internal successors, (1504), 1199 states have internal predecessors, (1504), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 06:20:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1552 transitions. [2024-11-09 06:20:13,600 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1552 transitions. Word has length 50 [2024-11-09 06:20:13,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:13,601 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1552 transitions. [2024-11-09 06:20:13,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) 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) [2024-11-09 06:20:13,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1552 transitions. [2024-11-09 06:20:13,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 06:20:13,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:13,606 INFO L215 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] [2024-11-09 06:20:13,612 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:13,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:13,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:13,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash -842298030, now seen corresponding path program 1 times [2024-11-09 06:20:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:13,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878974263] [2024-11-09 06:20:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:13,808 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 [2024-11-09 06:20:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:13,809 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:13,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:14,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:20:14,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:14,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:14,471 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:14,472 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:14,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878974263] [2024-11-09 06:20:14,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878974263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:14,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:14,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:20:14,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91268451] [2024-11-09 06:20:14,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:14,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:20:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:14,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:20:14,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:20:14,474 INFO L87 Difference]: Start difference. First operand 1212 states and 1552 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:14,800 INFO L93 Difference]: Finished difference Result 1735 states and 2290 transitions. [2024-11-09 06:20:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:20:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 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 58 [2024-11-09 06:20:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:14,806 INFO L225 Difference]: With dead ends: 1735 [2024-11-09 06:20:14,806 INFO L226 Difference]: Without dead ends: 1735 [2024-11-09 06:20:14,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:20:14,807 INFO L432 NwaCegarLoop]: 1222 mSDtfsCounter, 319 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 2151 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:14,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 2151 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 06:20:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2024-11-09 06:20:14,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1586. [2024-11-09 06:20:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1586 states, 1161 states have (on average 1.892334194659776) internal successors, (2197), 1571 states have internal predecessors, (2197), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 06:20:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1586 states to 1586 states and 2249 transitions. [2024-11-09 06:20:14,838 INFO L78 Accepts]: Start accepts. Automaton has 1586 states and 2249 transitions. Word has length 58 [2024-11-09 06:20:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:14,839 INFO L471 AbstractCegarLoop]: Abstraction has 1586 states and 2249 transitions. [2024-11-09 06:20:14,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1586 states and 2249 transitions. [2024-11-09 06:20:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-09 06:20:14,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:14,840 INFO L215 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] [2024-11-09 06:20:14,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:15,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:15,041 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:15,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:15,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1809034087, now seen corresponding path program 1 times [2024-11-09 06:20:15,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:15,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302957538] [2024-11-09 06:20:15,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:15,042 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 [2024-11-09 06:20:15,042 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:15,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:15,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:15,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:15,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 06:20:15,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:15,460 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 [2024-11-09 06:20:15,468 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 [2024-11-09 06:20:16,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 06:20:16,216 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 [2024-11-09 06:20:16,236 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:20:16,236 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 [2024-11-09 06:20:16,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:16,253 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:16,253 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:16,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302957538] [2024-11-09 06:20:16,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302957538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:16,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:16,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 06:20:16,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729774577] [2024-11-09 06:20:16,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:16,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:16,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:16,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:16,256 INFO L87 Difference]: Start difference. First operand 1586 states and 2249 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:18,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:18,406 INFO L93 Difference]: Finished difference Result 1559 states and 2223 transitions. [2024-11-09 06:20:18,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:18,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-09 06:20:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:18,412 INFO L225 Difference]: With dead ends: 1559 [2024-11-09 06:20:18,413 INFO L226 Difference]: Without dead ends: 1559 [2024-11-09 06:20:18,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:18,414 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1620 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:18,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 470 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 06:20:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1559 states. [2024-11-09 06:20:18,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1118. [2024-11-09 06:20:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 736 states have (on average 1.7826086956521738) internal successors, (1312), 1106 states have internal predecessors, (1312), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 06:20:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1358 transitions. [2024-11-09 06:20:18,438 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1358 transitions. Word has length 61 [2024-11-09 06:20:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:18,439 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1358 transitions. [2024-11-09 06:20:18,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1358 transitions. [2024-11-09 06:20:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:20:18,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:18,440 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-09 06:20:18,448 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:18,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:18,644 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:18,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:18,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1763462491, now seen corresponding path program 1 times [2024-11-09 06:20:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:18,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061156786] [2024-11-09 06:20:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:18,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:18,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:18,648 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:18,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:18,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:20:18,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:18,939 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 [2024-11-09 06:20:18,954 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 [2024-11-09 06:20:18,992 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 [2024-11-09 06:20:19,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:19,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:19,007 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:19,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061156786] [2024-11-09 06:20:19,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061156786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:19,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:19,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:19,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45294477] [2024-11-09 06:20:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:19,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:20:19,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:19,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:20:19,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:19,010 INFO L87 Difference]: Start difference. First operand 1118 states and 1358 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:21,656 INFO L93 Difference]: Finished difference Result 1117 states and 1357 transitions. [2024-11-09 06:20:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:20:21,656 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-09 06:20:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:21,658 INFO L225 Difference]: With dead ends: 1117 [2024-11-09 06:20:21,658 INFO L226 Difference]: Without dead ends: 1117 [2024-11-09 06:20:21,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:20:21,659 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2574 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:21,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2574 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 06:20:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-11-09 06:20:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2024-11-09 06:20:21,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 736 states have (on average 1.78125) internal successors, (1311), 1105 states have internal predecessors, (1311), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 06:20:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1357 transitions. [2024-11-09 06:20:21,678 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1357 transitions. Word has length 66 [2024-11-09 06:20:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1357 transitions. [2024-11-09 06:20:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1357 transitions. [2024-11-09 06:20:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-09 06:20:21,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:21,680 INFO L215 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, 1, 1, 1, 1, 1] [2024-11-09 06:20:21,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-09 06:20:21,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:21,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:21,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1763462490, now seen corresponding path program 1 times [2024-11-09 06:20:21,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:21,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112448453] [2024-11-09 06:20:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:21,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:21,885 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:21,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:22,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 06:20:22,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:22,248 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 [2024-11-09 06:20:22,290 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 [2024-11-09 06:20:22,301 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 [2024-11-09 06:20:22,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 21 treesize of output 9 [2024-11-09 06:20:22,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:22,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:22,386 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:22,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112448453] [2024-11-09 06:20:22,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112448453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:22,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:22,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:22,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30297709] [2024-11-09 06:20:22,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:22,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 06:20:22,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:22,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 06:20:22,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 06:20:22,388 INFO L87 Difference]: Start difference. First operand 1117 states and 1357 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:25,738 INFO L93 Difference]: Finished difference Result 1116 states and 1356 transitions. [2024-11-09 06:20:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:20:25,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2024-11-09 06:20:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:25,741 INFO L225 Difference]: With dead ends: 1116 [2024-11-09 06:20:25,741 INFO L226 Difference]: Without dead ends: 1116 [2024-11-09 06:20:25,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:20:25,742 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 1 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:25,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2614 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 06:20:25,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-09 06:20:25,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2024-11-09 06:20:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 735 states have (on average 1.782312925170068) internal successors, (1310), 1104 states have internal predecessors, (1310), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 06:20:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1356 transitions. [2024-11-09 06:20:25,759 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1356 transitions. Word has length 66 [2024-11-09 06:20:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:25,760 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1356 transitions. [2024-11-09 06:20:25,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 06:20:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1356 transitions. [2024-11-09 06:20:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 06:20:25,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:25,761 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:25,768 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:25,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:25,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:25,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:25,965 INFO L85 PathProgramCache]: Analyzing trace with hash -66794836, now seen corresponding path program 1 times [2024-11-09 06:20:25,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:25,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815278042] [2024-11-09 06:20:25,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:25,966 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 [2024-11-09 06:20:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:25,967 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:25,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:26,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:26,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 06:20:26,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:26,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 06:20:26,285 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815278042] [2024-11-09 06:20:26,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815278042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:20:26,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:20:26,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 06:20:26,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606515133] [2024-11-09 06:20:26,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:20:26,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 06:20:26,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:26,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 06:20:26,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:26,290 INFO L87 Difference]: Start difference. First operand 1116 states and 1356 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-09 06:20:26,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:26,335 INFO L93 Difference]: Finished difference Result 1119 states and 1360 transitions. [2024-11-09 06:20:26,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 06:20:26,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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 74 [2024-11-09 06:20:26,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:26,340 INFO L225 Difference]: With dead ends: 1119 [2024-11-09 06:20:26,340 INFO L226 Difference]: Without dead ends: 1119 [2024-11-09 06:20:26,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 06:20:26,341 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 0 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2881 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:26,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2881 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 06:20:26,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2024-11-09 06:20:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2024-11-09 06:20:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 737 states have (on average 1.7815468113975577) internal successors, (1313), 1107 states have internal predecessors, (1313), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:20:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1360 transitions. [2024-11-09 06:20:26,364 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1360 transitions. Word has length 74 [2024-11-09 06:20:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:26,365 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1360 transitions. [2024-11-09 06:20:26,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) [2024-11-09 06:20:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1360 transitions. [2024-11-09 06:20:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-09 06:20:26,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:26,366 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:26,373 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:26,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:26,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:26,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:26,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1148967796, now seen corresponding path program 1 times [2024-11-09 06:20:26,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:26,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741916998] [2024-11-09 06:20:26,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:26,568 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 [2024-11-09 06:20:26,569 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:26,571 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:26,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:26,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:20:26,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:26,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:26,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:27,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:27,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:27,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741916998] [2024-11-09 06:20:27,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741916998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:20:27,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1288099528] [2024-11-09 06:20:27,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:27,058 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:20:27,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:20:27,061 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:20:27,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2024-11-09 06:20:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:20:27,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:27,626 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:27,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1288099528] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:20:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825227332] [2024-11-09 06:20:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:20:27,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:27,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:20:27,672 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:20:27,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 06:20:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:20:27,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 06:20:28,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:28,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:28,017 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:28,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825227332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:20:28,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:20:28,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2024-11-09 06:20:28,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195654213] [2024-11-09 06:20:28,051 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:20:28,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 06:20:28,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:28,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 06:20:28,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 06:20:28,053 INFO L87 Difference]: Start difference. First operand 1119 states and 1360 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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) [2024-11-09 06:20:28,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:20:28,275 INFO L93 Difference]: Finished difference Result 1131 states and 1377 transitions. [2024-11-09 06:20:28,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:20:28,277 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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 75 [2024-11-09 06:20:28,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:20:28,283 INFO L225 Difference]: With dead ends: 1131 [2024-11-09 06:20:28,283 INFO L226 Difference]: Without dead ends: 1131 [2024-11-09 06:20:28,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 06:20:28,284 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 7 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2884 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:20:28,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2884 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 06:20:28,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2024-11-09 06:20:28,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1129. [2024-11-09 06:20:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 746 states have (on average 1.7801608579088473) internal successors, (1328), 1116 states have internal predecessors, (1328), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:20:28,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1375 transitions. [2024-11-09 06:20:28,304 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1375 transitions. Word has length 75 [2024-11-09 06:20:28,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:20:28,304 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1375 transitions. [2024-11-09 06:20:28,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 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) [2024-11-09 06:20:28,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1375 transitions. [2024-11-09 06:20:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 06:20:28,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:20:28,307 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:20:28,313 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2024-11-09 06:20:28,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:28,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-09 06:20:28,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:28,909 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:20:28,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:20:28,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1912847700, now seen corresponding path program 2 times [2024-11-09 06:20:28,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:20:28,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539027721] [2024-11-09 06:20:28,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:20:28,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:20:28,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:20:28,911 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:20:28,912 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:20:29,375 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:20:29,375 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:20:29,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:20:29,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:29,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:29,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:29,724 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:29,724 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:20:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539027721] [2024-11-09 06:20:29,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539027721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:20:29,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1442664129] [2024-11-09 06:20:29,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:20:29,725 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:20:29,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:20:29,728 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:20:29,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2024-11-09 06:20:31,267 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:20:31,267 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:20:31,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 06:20:31,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:31,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:31,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:31,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:20:31,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1442664129] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:20:31,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38807124] [2024-11-09 06:20:31,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:20:31,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:20:31,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:20:31,437 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:20:31,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 06:20:58,942 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:20:58,942 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:20:58,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 06:20:58,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:20:58,965 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 [2024-11-09 06:20:59,113 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:20:59,114 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 [2024-11-09 06:20:59,148 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 [2024-11-09 06:20:59,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:20:59,462 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 [2024-11-09 06:20:59,549 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 [2024-11-09 06:20:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 06:20:59,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:20:59,744 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:20:59,744 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 [2024-11-09 06:20:59,758 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1629 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_1629) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2024-11-09 06:20:59,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38807124] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:20:59,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:20:59,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 10] total 23 [2024-11-09 06:20:59,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601494330] [2024-11-09 06:20:59,765 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:20:59,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 06:20:59,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:20:59,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 06:20:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=467, Unknown=1, NotChecked=44, Total=600 [2024-11-09 06:20:59,767 INFO L87 Difference]: Start difference. First operand 1129 states and 1375 transitions. Second operand has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:21:12,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:12,737 INFO L93 Difference]: Finished difference Result 1153 states and 1406 transitions. [2024-11-09 06:21:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-09 06:21:12,738 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 78 [2024-11-09 06:21:12,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:12,742 INFO L225 Difference]: With dead ends: 1153 [2024-11-09 06:21:12,742 INFO L226 Difference]: Without dead ends: 1149 [2024-11-09 06:21:12,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 366 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=407, Invalid=2046, Unknown=1, NotChecked=96, Total=2550 [2024-11-09 06:21:12,743 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 870 mSDsluCounter, 5708 mSDsCounter, 0 mSdLazyCounter, 6741 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 6194 SdHoareTripleChecker+Invalid, 6761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:12,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 6194 Invalid, 6761 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 6741 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2024-11-09 06:21:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-11-09 06:21:12,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1137. [2024-11-09 06:21:12,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 755 states have (on average 1.7735099337748343) internal successors, (1339), 1124 states have internal predecessors, (1339), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:21:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1386 transitions. [2024-11-09 06:21:12,764 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1386 transitions. Word has length 78 [2024-11-09 06:21:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:12,764 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1386 transitions. [2024-11-09 06:21:12,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 6.954545454545454) internal successors, (153), 22 states have internal predecessors, (153), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:21:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1386 transitions. [2024-11-09 06:21:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 06:21:12,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:12,766 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:12,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:21:13,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:13,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:21:13,367 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:21:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -966330707, now seen corresponding path program 1 times [2024-11-09 06:21:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:21:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256737287] [2024-11-09 06:21:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:13,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:21:13,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:21:13,372 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:21:13,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-09 06:21:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:13,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:21:13,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:13,895 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:13,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:14,492 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:21:14,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256737287] [2024-11-09 06:21:14,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256737287] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:14,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946436209] [2024-11-09 06:21:14,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:14,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:21:14,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:21:14,495 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:21:14,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-09 06:21:15,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:15,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 06:21:15,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:15,236 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:15,236 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:15,387 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:15,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946436209] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:15,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543585878] [2024-11-09 06:21:15,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:21:15,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:15,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:15,390 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:21:15,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-09 06:21:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:21:15,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 06:21:15,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:15,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:16,669 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:16,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543585878] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:16,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2024-11-09 06:21:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2024-11-09 06:21:16,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551655969] [2024-11-09 06:21:16,670 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2024-11-09 06:21:16,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-09 06:21:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:21:16,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-09 06:21:16,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 06:21:16,674 INFO L87 Difference]: Start difference. First operand 1137 states and 1386 transitions. Second operand has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:21:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:21:18,876 INFO L93 Difference]: Finished difference Result 1163 states and 1427 transitions. [2024-11-09 06:21:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 06:21:18,877 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 84 [2024-11-09 06:21:18,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:21:18,881 INFO L225 Difference]: With dead ends: 1163 [2024-11-09 06:21:18,882 INFO L226 Difference]: Without dead ends: 1157 [2024-11-09 06:21:18,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 462 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1168, Invalid=2254, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 06:21:18,884 INFO L432 NwaCegarLoop]: 962 mSDtfsCounter, 17 mSDsluCounter, 12464 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13426 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:21:18,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 13426 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 06:21:18,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-09 06:21:18,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1155. [2024-11-09 06:21:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1155 states, 773 states have (on average 1.761966364812419) internal successors, (1362), 1142 states have internal predecessors, (1362), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:21:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1409 transitions. [2024-11-09 06:21:18,904 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1409 transitions. Word has length 84 [2024-11-09 06:21:18,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:21:18,904 INFO L471 AbstractCegarLoop]: Abstraction has 1155 states and 1409 transitions. [2024-11-09 06:21:18,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 38 states have internal predecessors, (109), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 06:21:18,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1409 transitions. [2024-11-09 06:21:18,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 06:21:18,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:21:18,905 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:21:18,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2024-11-09 06:21:19,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:19,311 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-09 06:21:19,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:21:19,507 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:21:19,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:21:19,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1928814253, now seen corresponding path program 2 times [2024-11-09 06:21:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:21:19,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614899037] [2024-11-09 06:21:19,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:21:19,508 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 [2024-11-09 06:21:19,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:21:19,512 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:21:19,513 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:21:20,075 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:21:20,076 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:21:20,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:21:20,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:20,574 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:20,574 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:22,421 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:21:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614899037] [2024-11-09 06:21:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614899037] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:22,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [961844676] [2024-11-09 06:21:22,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:21:22,422 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:21:22,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:21:22,426 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:21:22,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2024-11-09 06:21:24,379 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:21:24,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:21:24,419 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 06:21:24,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:24,500 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:24,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:24,883 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:21:24,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [961844676] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 06:21:24,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899961942] [2024-11-09 06:21:24,884 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 06:21:24,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:21:24,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:21:24,886 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:21:24,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-11-09 06:21:55,116 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 06:21:55,117 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 06:21:55,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:21:55,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:21:55,158 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 [2024-11-09 06:21:55,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 06:21:55,464 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:21:55,464 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 [2024-11-09 06:21:55,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 19 treesize of output 1 [2024-11-09 06:21:55,588 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 [2024-11-09 06:21:55,936 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 [2024-11-09 06:21:55,942 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 [2024-11-09 06:21:56,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:21:56,754 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 [2024-11-09 06:21:56,762 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 [2024-11-09 06:21:56,956 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 [2024-11-09 06:21:56,966 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 [2024-11-09 06:21:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-09 06:21:57,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:21:57,986 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2932 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2933 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2932) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2933 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2933) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2024-11-09 06:21:57,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899961942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:21:57,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2024-11-09 06:21:57,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 8] total 57 [2024-11-09 06:21:57,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718676285] [2024-11-09 06:21:57,992 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2024-11-09 06:21:57,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-09 06:21:57,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:21:57,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-09 06:21:57,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2728, Unknown=1, NotChecked=114, Total=3540 [2024-11-09 06:21:57,995 INFO L87 Difference]: Start difference. First operand 1155 states and 1409 transitions. Second operand has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:22:36,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:36,269 INFO L93 Difference]: Finished difference Result 1206 states and 1490 transitions. [2024-11-09 06:22:36,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-11-09 06:22:36,270 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 96 [2024-11-09 06:22:36,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:36,275 INFO L225 Difference]: With dead ends: 1206 [2024-11-09 06:22:36,275 INFO L226 Difference]: Without dead ends: 1198 [2024-11-09 06:22:36,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3062 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=3100, Invalid=14459, Unknown=1, NotChecked=262, Total=17822 [2024-11-09 06:22:36,281 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 850 mSDsluCounter, 14226 mSDsCounter, 0 mSdLazyCounter, 14769 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 14782 SdHoareTripleChecker+Invalid, 14850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 14769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:36,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 14782 Invalid, 14850 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [81 Valid, 14769 Invalid, 0 Unknown, 0 Unchecked, 29.1s Time] [2024-11-09 06:22:36,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2024-11-09 06:22:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 1188. [2024-11-09 06:22:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 807 states have (on average 1.738537794299876) internal successors, (1403), 1175 states have internal predecessors, (1403), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:22:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1450 transitions. [2024-11-09 06:22:36,303 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1450 transitions. Word has length 96 [2024-11-09 06:22:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:36,303 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1450 transitions. [2024-11-09 06:22:36,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.375) internal successors, (189), 57 states have internal predecessors, (189), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 06:22:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1450 transitions. [2024-11-09 06:22:36,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:22:36,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:36,305 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:22:36,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:36,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:36,740 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:36,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:36,906 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:22:36,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:36,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1108603488, now seen corresponding path program 1 times [2024-11-09 06:22:36,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:22:36,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408929176] [2024-11-09 06:22:36,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:36,907 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 [2024-11-09 06:22:36,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:22:36,909 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:22:36,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-09 06:22:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:37,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-09 06:22:37,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:37,813 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 [2024-11-09 06:22:37,983 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:22:37,984 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 [2024-11-09 06:22:38,032 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 [2024-11-09 06:22:38,155 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 [2024-11-09 06:22:39,486 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:39,486 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 [2024-11-09 06:22:39,641 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:39,641 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 [2024-11-09 06:22:39,678 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 [2024-11-09 06:22:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:22:39,724 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:39,856 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3357) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:22:40,288 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3403 (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$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3403))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3357)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:22:40,290 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:22:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408929176] [2024-11-09 06:22:40,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408929176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:40,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [774403701] [2024-11-09 06:22:40,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:40,291 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:22:40,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:22:40,292 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:22:40,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2024-11-09 06:22:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:43,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 06:22:43,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:43,088 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 [2024-11-09 06:22:43,261 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:22:43,262 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 [2024-11-09 06:22:43,299 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 [2024-11-09 06:22:43,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 24 treesize of output 12 [2024-11-09 06:22:44,524 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:44,524 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 [2024-11-09 06:22:44,646 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:44,647 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 [2024-11-09 06:22:44,682 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 [2024-11-09 06:22:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:22:44,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:44,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3827) |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 [2024-11-09 06:22:44,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3827) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:22:45,146 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3827 (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$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3873))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3827)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:22:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [774403701] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:45,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476479559] [2024-11-09 06:22:45,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:45,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:22:45,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:22:45,150 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:22:45,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2024-11-09 06:22:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:45,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-09 06:22:45,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:45,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 06:22:45,984 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:22:45,984 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 [2024-11-09 06:22:46,026 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 [2024-11-09 06:22:46,840 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:46,840 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 [2024-11-09 06:22:47,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:47,017 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 [2024-11-09 06:22:47,037 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 [2024-11-09 06:22:47,041 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:22:47,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:47,590 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2024-11-09 06:22:47,590 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 [2024-11-09 06:22:47,600 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3357 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4342 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem36#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4342))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3357)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-09 06:22:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476479559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:47,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:22:47,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 18 [2024-11-09 06:22:47,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900927560] [2024-11-09 06:22:47,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:22:47,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 06:22:47,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:22:47,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 06:22:47,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=347, Unknown=15, NotChecked=258, Total=702 [2024-11-09 06:22:47,604 INFO L87 Difference]: Start difference. First operand 1188 states and 1450 transitions. Second operand has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 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) [2024-11-09 06:22:55,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:22:55,068 INFO L93 Difference]: Finished difference Result 1197 states and 1459 transitions. [2024-11-09 06:22:55,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:22:55,068 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 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 121 [2024-11-09 06:22:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:22:55,075 INFO L225 Difference]: With dead ends: 1197 [2024-11-09 06:22:55,075 INFO L226 Difference]: Without dead ends: 1197 [2024-11-09 06:22:55,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 352 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=103, Invalid=458, Unknown=15, NotChecked=294, Total=870 [2024-11-09 06:22:55,076 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 851 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 3552 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 3303 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-09 06:22:55,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 3303 Invalid, 3564 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [12 Valid, 3552 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-09 06:22:55,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2024-11-09 06:22:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1187. [2024-11-09 06:22:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 807 states have (on average 1.7372986369268897) internal successors, (1402), 1174 states have internal predecessors, (1402), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:22:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1449 transitions. [2024-11-09 06:22:55,099 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1449 transitions. Word has length 121 [2024-11-09 06:22:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:22:55,100 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1449 transitions. [2024-11-09 06:22:55,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.9375) internal successors, (95), 18 states have internal predecessors, (95), 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) [2024-11-09 06:22:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1449 transitions. [2024-11-09 06:22:55,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 06:22:55,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:22:55,102 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:22:55,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:55,310 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:55,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2024-11-09 06:22:55,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:22:55,703 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:22:55,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:22:55,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1108603489, now seen corresponding path program 1 times [2024-11-09 06:22:55,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:22:55,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184894415] [2024-11-09 06:22:55,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:55,704 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 [2024-11-09 06:22:55,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:22:55,706 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:22:55,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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 [2024-11-09 06:22:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:22:56,624 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 06:22:56,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:22:56,639 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 [2024-11-09 06:22:56,803 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 [2024-11-09 06:22:56,819 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:22:56,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-09 06:22:56,848 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 [2024-11-09 06:22:56,858 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 [2024-11-09 06:22:57,000 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 [2024-11-09 06:22:57,006 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 [2024-11-09 06:22:57,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:57,980 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 [2024-11-09 06:22:57,988 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 [2024-11-09 06:22:58,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:22:58,150 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 [2024-11-09 06:22:58,158 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 [2024-11-09 06:22:58,196 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 [2024-11-09 06:22:58,203 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 [2024-11-09 06:22:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:22:58,246 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:22:58,406 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:22:58,434 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-09 06:22:59,903 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4812 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4904))) (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$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4905) .cse0 v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4812) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4904 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4905 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4905) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4904) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4813) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2024-11-09 06:22:59,910 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:22:59,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184894415] [2024-11-09 06:22:59,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [184894415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:22:59,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1615995945] [2024-11-09 06:22:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:22:59,911 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:22:59,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:22:59,912 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:22:59,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2024-11-09 06:24:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:37,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 113 conjuncts are in the unsatisfiable core [2024-11-09 06:24:37,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:37,062 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 [2024-11-09 06:24:37,236 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:24:37,236 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 [2024-11-09 06:24:37,248 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 [2024-11-09 06:24:37,264 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 [2024-11-09 06:24:37,274 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 [2024-11-09 06:24:37,357 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 [2024-11-09 06:24:37,364 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 [2024-11-09 06:24:38,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:38,313 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 [2024-11-09 06:24:38,321 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 [2024-11-09 06:24:38,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:38,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:24:38,475 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 [2024-11-09 06:24:38,509 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 [2024-11-09 06:24:38,514 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 [2024-11-09 06:24:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:24:38,521 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:38,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2024-11-09 06:24:38,605 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-09 06:24:40,227 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5468) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5467 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5375 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5376 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5467))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5468) .cse2 v_ArrVal_5375) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5376) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:24:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1615995945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:40,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876745549] [2024-11-09 06:24:40,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:24:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:24:40,238 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:24:40,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2024-11-09 06:24:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:40,958 INFO L255 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 112 conjuncts are in the unsatisfiable core [2024-11-09 06:24:40,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:40,981 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 [2024-11-09 06:24:41,199 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:24:41,199 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 [2024-11-09 06:24:41,207 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 [2024-11-09 06:24:41,220 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 [2024-11-09 06:24:41,225 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 [2024-11-09 06:24:41,332 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 [2024-11-09 06:24:41,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 06:24:42,224 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:42,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 62 treesize of output 57 [2024-11-09 06:24:42,233 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 [2024-11-09 06:24:42,349 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:42,350 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 [2024-11-09 06:24:42,363 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 [2024-11-09 06:24:42,413 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 [2024-11-09 06:24:42,420 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 [2024-11-09 06:24:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:24:42,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:42,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5939 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:24:42,549 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5939 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2024-11-09 06:24:44,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5939 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6031))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6030) .cse0 v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5939) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6030 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6031 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5938 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6030) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5938) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2024-11-09 06:24:44,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876745549] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:44,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:24:44,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2024-11-09 06:24:44,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549852315] [2024-11-09 06:24:44,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:24:44,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 06:24:44,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:24:44,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 06:24:44,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=113, Unknown=9, NotChecked=252, Total=420 [2024-11-09 06:24:44,199 INFO L87 Difference]: Start difference. First operand 1187 states and 1449 transitions. Second operand has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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) [2024-11-09 06:24:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:24:52,507 INFO L93 Difference]: Finished difference Result 1194 states and 1456 transitions. [2024-11-09 06:24:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 06:24:52,507 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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 121 [2024-11-09 06:24:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:24:52,512 INFO L225 Difference]: With dead ends: 1194 [2024-11-09 06:24:52,512 INFO L226 Difference]: Without dead ends: 1194 [2024-11-09 06:24:52,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 357 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=222, Unknown=9, NotChecked=342, Total=650 [2024-11-09 06:24:52,513 INFO L432 NwaCegarLoop]: 556 mSDtfsCounter, 797 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 2907 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 801 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-11-09 06:24:52,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [801 Valid, 2065 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2907 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2024-11-09 06:24:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-09 06:24:52,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1186. [2024-11-09 06:24:52,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1186 states, 807 states have (on average 1.7360594795539033) internal successors, (1401), 1173 states have internal predecessors, (1401), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:24:52,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1448 transitions. [2024-11-09 06:24:52,535 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1448 transitions. Word has length 121 [2024-11-09 06:24:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:24:52,537 INFO L471 AbstractCegarLoop]: Abstraction has 1186 states and 1448 transitions. [2024-11-09 06:24:52,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.625) internal successors, (77), 10 states have internal predecessors, (77), 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) [2024-11-09 06:24:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1448 transitions. [2024-11-09 06:24:52,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:24:52,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:24:52,541 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:24:52,573 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2024-11-09 06:24:52,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2024-11-09 06:24:52,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2024-11-09 06:24:53,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:24:53,142 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:24:53,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:24:53,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1891597997, now seen corresponding path program 1 times [2024-11-09 06:24:53,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:24:53,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1573994516] [2024-11-09 06:24:53,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:53,144 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 [2024-11-09 06:24:53,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:24:53,145 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:24:53,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2024-11-09 06:24:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:24:54,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-11-09 06:24:54,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:24:54,491 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 [2024-11-09 06:24:54,737 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:24:54,738 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 [2024-11-09 06:24:54,783 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 [2024-11-09 06:24:54,954 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 [2024-11-09 06:24:56,170 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:56,170 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 [2024-11-09 06:24:56,323 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:56,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:24:56,443 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:24:56,443 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 [2024-11-09 06:24:56,476 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 [2024-11-09 06:24:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:24:56,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:24:56,623 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 06:24:56,636 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:24:56,659 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (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$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6470))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:24:56,676 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6470))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:24:57,220 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6470 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6471 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6517 (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$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6517))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6470)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6471)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:24:57,224 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:24:57,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1573994516] [2024-11-09 06:24:57,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1573994516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:24:57,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [413063704] [2024-11-09 06:24:57,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:24:57,225 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:24:57,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:24:57,226 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:24:57,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2024-11-09 06:25:22,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:23,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:25:23,039 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:23,047 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 [2024-11-09 06:25:23,305 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:25:23,305 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 [2024-11-09 06:25:23,333 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 [2024-11-09 06:25:23,438 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 [2024-11-09 06:25:24,806 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:24,806 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 [2024-11-09 06:25:24,952 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:24,952 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 [2024-11-09 06:25:25,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:25,053 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 [2024-11-09 06:25:25,098 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 [2024-11-09 06:25:25,114 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:25:25,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:25,210 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:25:25,229 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6957 (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$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6956))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6957)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:25:25,242 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6957 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6956))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6957)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:25:25,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6956 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6957 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7003 (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$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7003))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6956)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6957)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:25:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [413063704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407403752] [2024-11-09 06:25:25,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:25,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:25:25,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:25:25,856 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:25:25,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2024-11-09 06:25:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:26,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-09 06:25:26,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:27,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:25:27,158 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 [2024-11-09 06:25:27,200 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 [2024-11-09 06:25:27,747 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:27,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 06:25:27,873 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:27,874 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 31 treesize of output 32 [2024-11-09 06:25:28,006 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:28,007 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 [2024-11-09 06:25:28,113 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 [2024-11-09 06:25:28,118 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:25:28,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:28,152 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:25:28,152 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 [2024-11-09 06:25:28,257 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 06:25:28,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7440)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 06:25:28,313 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7440))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:25:28,846 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7487 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7487))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7440)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_7441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:25:28,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407403752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:28,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:25:28,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 19 [2024-11-09 06:25:28,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024729016] [2024-11-09 06:25:28,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:25:28,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-09 06:25:28,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:25:28,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-09 06:25:28,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=414, Unknown=37, NotChecked=702, Total=1260 [2024-11-09 06:25:28,853 INFO L87 Difference]: Start difference. First operand 1186 states and 1448 transitions. Second operand has 20 states, 17 states have (on average 6.176470588235294) internal successors, (105), 20 states have internal predecessors, (105), 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) [2024-11-09 06:25:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:25:43,820 INFO L93 Difference]: Finished difference Result 1195 states and 1457 transitions. [2024-11-09 06:25:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 06:25:43,821 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.176470588235294) internal successors, (105), 20 states have internal predecessors, (105), 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 124 [2024-11-09 06:25:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:25:43,825 INFO L225 Difference]: With dead ends: 1195 [2024-11-09 06:25:43,825 INFO L226 Difference]: Without dead ends: 1195 [2024-11-09 06:25:43,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 362 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=116, Invalid=451, Unknown=37, NotChecked=728, Total=1332 [2024-11-09 06:25:43,826 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 840 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 5966 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 5634 SdHoareTripleChecker+Invalid, 5977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2024-11-09 06:25:43,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 5634 Invalid, 5977 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 5966 Invalid, 0 Unknown, 0 Unchecked, 14.7s Time] [2024-11-09 06:25:43,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2024-11-09 06:25:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1185. [2024-11-09 06:25:43,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 807 states have (on average 1.734820322180917) internal successors, (1400), 1172 states have internal predecessors, (1400), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:25:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1447 transitions. [2024-11-09 06:25:43,848 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1447 transitions. Word has length 124 [2024-11-09 06:25:43,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:25:43,849 INFO L471 AbstractCegarLoop]: Abstraction has 1185 states and 1447 transitions. [2024-11-09 06:25:43,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.176470588235294) internal successors, (105), 20 states have internal predecessors, (105), 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) [2024-11-09 06:25:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1447 transitions. [2024-11-09 06:25:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 06:25:43,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:25:43,850 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:25:43,890 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2024-11-09 06:25:44,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (37)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:44,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2024-11-09 06:25:44,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 06:25:44,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:25:44,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:25:44,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1891597996, now seen corresponding path program 1 times [2024-11-09 06:25:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:25:44,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814901917] [2024-11-09 06:25:44,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:44,454 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 [2024-11-09 06:25:44,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:25:44,455 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:25:44,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2024-11-09 06:25:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:25:45,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-09 06:25:45,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:25:45,814 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 [2024-11-09 06:25:45,983 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 [2024-11-09 06:25:45,996 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:25:45,997 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 [2024-11-09 06:25:46,021 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 [2024-11-09 06:25:46,027 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 [2024-11-09 06:25:46,165 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 [2024-11-09 06:25:46,171 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 [2024-11-09 06:25:47,201 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:47,202 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 [2024-11-09 06:25:47,220 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 [2024-11-09 06:25:47,373 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:47,374 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 [2024-11-09 06:25:47,382 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 [2024-11-09 06:25:47,505 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:25:47,505 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 [2024-11-09 06:25:47,512 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 [2024-11-09 06:25:47,546 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 [2024-11-09 06:25:47,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-09 06:25:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:25:47,590 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:25:47,929 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:25:48,006 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7972))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7973) .cse0 v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7973) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2024-11-09 06:25:48,139 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7973) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7972))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7973) .cse3 v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:25:51,258 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8066))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8067) .cse1 v_ArrVal_7973) (select (select (store .cse2 .cse1 v_ArrVal_7972) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7974))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7973 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7972 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8066))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7972))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv12 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8067) .cse4 v_ArrVal_7973) .cse5 v_ArrVal_7974) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 06:25:51,274 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:25:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814901917] [2024-11-09 06:25:51,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814901917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:25:51,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551960697] [2024-11-09 06:25:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:25:51,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:25:51,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:25:51,277 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:25:51,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2024-11-09 06:26:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:37,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 117 conjuncts are in the unsatisfiable core [2024-11-09 06:26:37,378 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:26:37,389 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 [2024-11-09 06:26:37,920 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 [2024-11-09 06:26:37,971 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:26:37,971 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 [2024-11-09 06:26:37,997 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 [2024-11-09 06:26:38,010 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 [2024-11-09 06:26:38,193 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 [2024-11-09 06:26:38,204 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 [2024-11-09 06:26:40,129 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:40,129 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 [2024-11-09 06:26:40,143 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 [2024-11-09 06:26:40,361 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:40,362 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 [2024-11-09 06:26:40,375 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 [2024-11-09 06:26:40,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:40,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 62 treesize of output 57 [2024-11-09 06:26:40,568 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 [2024-11-09 06:26:40,631 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 [2024-11-09 06:26:40,641 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 [2024-11-09 06:26:40,657 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:26:40,657 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:26:40,779 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:26:40,825 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2024-11-09 06:26:40,917 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8552))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8553) .cse0 v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8553) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd (_ bv12 32) .cse3)))))) is different from false [2024-11-09 06:26:41,017 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8553) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8552))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8553) .cse3 v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:26:43,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8555 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8646))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8552))) (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$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8647) .cse0 v_ArrVal_8553) .cse1 v_ArrVal_8554) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8555) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8647 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8554 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8553 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8552 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8646))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8647) .cse6 v_ArrVal_8553) (select (select (store .cse7 .cse6 v_ArrVal_8552) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8554))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd (_ bv12 32) .cse5)))))) is different from false [2024-11-09 06:26:43,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [551960697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:43,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647323923] [2024-11-09 06:26:43,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:26:43,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:26:43,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:26:43,993 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:26:43,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2024-11-09 06:26:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:26:44,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 115 conjuncts are in the unsatisfiable core [2024-11-09 06:26:44,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:26:44,931 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 [2024-11-09 06:26:45,555 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 [2024-11-09 06:26:45,617 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:26:45,618 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 [2024-11-09 06:26:45,645 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 [2024-11-09 06:26:45,669 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 [2024-11-09 06:26:45,865 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 [2024-11-09 06:26:45,879 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 [2024-11-09 06:26:48,265 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:48,265 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 [2024-11-09 06:26:48,279 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 [2024-11-09 06:26:48,507 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:48,507 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 [2024-11-09 06:26:48,520 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 [2024-11-09 06:26:48,690 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:26:48,690 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 [2024-11-09 06:26:48,703 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 [2024-11-09 06:26:48,773 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 [2024-11-09 06:26:48,784 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 [2024-11-09 06:26:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:26:48,802 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:26:48,926 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9135 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd (_ bv12 32) .cse1)))))) is different from false [2024-11-09 06:26:48,975 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9135 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_9135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:26:49,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9133) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9132))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9133) .cse2 v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:26:49,202 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9132))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9133) .cse1 v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9133) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2024-11-09 06:26:53,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9226 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9227))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9226) .cse1 v_ArrVal_9133) (select (select (store .cse2 .cse1 v_ArrVal_9132) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9134))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9134 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9133 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9132 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9135 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9227))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9132))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9226) .cse4 v_ArrVal_9133) .cse5 v_ArrVal_9134) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9135) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 06:26:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647323923] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:26:53,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:26:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2024-11-09 06:26:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933761963] [2024-11-09 06:26:53,093 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:26:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 06:26:53,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:26:53,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 06:26:53,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=154, Unknown=21, NotChecked=518, Total=756 [2024-11-09 06:26:53,095 INFO L87 Difference]: Start difference. First operand 1185 states and 1447 transitions. Second operand has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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) [2024-11-09 06:27:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:27:25,341 INFO L93 Difference]: Finished difference Result 1192 states and 1454 transitions. [2024-11-09 06:27:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 06:27:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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 124 [2024-11-09 06:27:25,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:27:25,344 INFO L225 Difference]: With dead ends: 1192 [2024-11-09 06:27:25,344 INFO L226 Difference]: Without dead ends: 1192 [2024-11-09 06:27:25,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 368 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=102, Invalid=312, Unknown=22, NotChecked=686, Total=1122 [2024-11-09 06:27:25,345 INFO L432 NwaCegarLoop]: 555 mSDtfsCounter, 795 mSDsluCounter, 2917 mSDsCounter, 0 mSdLazyCounter, 5336 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 3472 SdHoareTripleChecker+Invalid, 5343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.4s IncrementalHoareTripleChecker+Time [2024-11-09 06:27:25,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 3472 Invalid, 5343 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 5336 Invalid, 0 Unknown, 0 Unchecked, 31.4s Time] [2024-11-09 06:27:25,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2024-11-09 06:27:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1184. [2024-11-09 06:27:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 807 states have (on average 1.7335811648079307) internal successors, (1399), 1171 states have internal predecessors, (1399), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:27:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1446 transitions. [2024-11-09 06:27:25,366 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1446 transitions. Word has length 124 [2024-11-09 06:27:25,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:27:25,367 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1446 transitions. [2024-11-09 06:27:25,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.88888888888889) internal successors, (80), 11 states have internal predecessors, (80), 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) [2024-11-09 06:27:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1446 transitions. [2024-11-09 06:27:25,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:27:25,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:27:25,369 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:27:25,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2024-11-09 06:27:25,581 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2024-11-09 06:27:25,808 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2024-11-09 06:27:25,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:27:25,970 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:27:25,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:27:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1670366375, now seen corresponding path program 1 times [2024-11-09 06:27:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:27:25,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975776812] [2024-11-09 06:27:25,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:25,972 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 [2024-11-09 06:27:25,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:27:25,976 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:27:25,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2024-11-09 06:27:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:27:27,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 06:27:27,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:27:27,361 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 [2024-11-09 06:27:27,988 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:27:27,988 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 [2024-11-09 06:27:28,082 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 [2024-11-09 06:27:28,398 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 [2024-11-09 06:27:30,979 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:30,980 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 [2024-11-09 06:27:31,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:31,291 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 [2024-11-09 06:27:31,570 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:31,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:27:31,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:27:31,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 43 [2024-11-09 06:27:31,956 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 [2024-11-09 06:27:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:27:32,081 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:27:32,274 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9683) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 06:27:32,297 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9683) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:27:32,334 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9682 (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$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9682))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9683)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:32,363 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9682 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9682))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9683)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:32,418 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9681 (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$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9681))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9682)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9683)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:32,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9681 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9681))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9682)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9683)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:33,329 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9683 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9682 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9681 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9729 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9729))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9681)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9682)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9683)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:27:33,337 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:27:33,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975776812] [2024-11-09 06:27:33,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975776812] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:27:33,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [114214400] [2024-11-09 06:27:33,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:27:33,338 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:27:33,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:27:33,341 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:27:33,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2024-11-09 06:28:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:28:39,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 06:28:39,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:28:39,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 [2024-11-09 06:28:39,590 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:28:39,591 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 [2024-11-09 06:28:39,632 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 [2024-11-09 06:28:39,805 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 [2024-11-09 06:28:42,138 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:42,139 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 [2024-11-09 06:28:42,325 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:28:42,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:42,484 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 [2024-11-09 06:28:42,642 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:42,642 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 [2024-11-09 06:28:42,712 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 [2024-11-09 06:28:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:28:42,738 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:28:42,783 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10185) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 06:28:42,805 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:28:42,852 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (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$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10184))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:28:42,874 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10184))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:28:42,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10183 (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$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10183))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10184)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:28:42,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10183 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10183))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10184)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:28:43,822 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10231 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10183 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10231))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10183)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10184)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:28:43,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [114214400] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:28:43,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609840719] [2024-11-09 06:28:43,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:28:43,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:28:43,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:28:43,831 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:28:43,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2024-11-09 06:28:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:28:44,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 06:28:44,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:28:44,792 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 [2024-11-09 06:28:45,317 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:28:45,318 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 [2024-11-09 06:28:45,419 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 [2024-11-09 06:28:46,518 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:46,519 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 31 treesize of output 32 [2024-11-09 06:28:46,727 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:46,727 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 31 treesize of output 32 [2024-11-09 06:28:46,944 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:46,944 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 31 treesize of output 32 [2024-11-09 06:28:47,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:28:47,172 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 [2024-11-09 06:28:47,357 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 [2024-11-09 06:28:47,366 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:28:47,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:28:47,437 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:28:47,438 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 [2024-11-09 06:28:47,662 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse0)))) is different from false [2024-11-09 06:28:47,696 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10685)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-09 06:28:47,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10685))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:28:47,779 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10684))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10685)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:28:47,815 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10684 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10684))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10685)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_10686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:28:48,682 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10685 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10684 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10732))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10684)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10685)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_10686) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:28:48,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609840719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:28:48,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:28:48,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 21 [2024-11-09 06:28:48,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355252127] [2024-11-09 06:28:48,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:28:48,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 06:28:48,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:28:48,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 06:28:48,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=472, Unknown=31, NotChecked=1260, Total=1892 [2024-11-09 06:28:48,692 INFO L87 Difference]: Start difference. First operand 1184 states and 1446 transitions. Second operand has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 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) [2024-11-09 06:29:05,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:29:05,057 INFO L93 Difference]: Finished difference Result 1193 states and 1455 transitions. [2024-11-09 06:29:05,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 06:29:05,057 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 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 127 [2024-11-09 06:29:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:29:05,059 INFO L225 Difference]: With dead ends: 1193 [2024-11-09 06:29:05,060 INFO L226 Difference]: Without dead ends: 1193 [2024-11-09 06:29:05,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=138, Invalid=511, Unknown=31, NotChecked=1300, Total=1980 [2024-11-09 06:29:05,060 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 878 mSDsluCounter, 2362 mSDsCounter, 0 mSdLazyCounter, 3056 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 3103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 3056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2024-11-09 06:29:05,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 2847 Invalid, 3103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 3056 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2024-11-09 06:29:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-09 06:29:05,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1183. [2024-11-09 06:29:05,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 807 states have (on average 1.7323420074349443) internal successors, (1398), 1170 states have internal predecessors, (1398), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:29:05,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1445 transitions. [2024-11-09 06:29:05,083 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1445 transitions. Word has length 127 [2024-11-09 06:29:05,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:29:05,084 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1445 transitions. [2024-11-09 06:29:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 5.631578947368421) internal successors, (107), 22 states have internal predecessors, (107), 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) [2024-11-09 06:29:05,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1445 transitions. [2024-11-09 06:29:05,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 06:29:05,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:29:05,086 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:29:05,103 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2024-11-09 06:29:05,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2024-11-09 06:29:05,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2024-11-09 06:29:05,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:29:05,688 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:29:05,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:29:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1670366376, now seen corresponding path program 1 times [2024-11-09 06:29:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:29:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124324555] [2024-11-09 06:29:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:05,689 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 [2024-11-09 06:29:05,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:29:05,691 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:29:05,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2024-11-09 06:29:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:29:07,149 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 06:29:07,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:29:07,171 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 [2024-11-09 06:29:07,683 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:29:07,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 [2024-11-09 06:29:07,702 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 [2024-11-09 06:29:07,767 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 [2024-11-09 06:29:07,788 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 [2024-11-09 06:29:08,073 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 [2024-11-09 06:29:08,084 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 [2024-11-09 06:29:10,159 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:29:10,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 06:29:10,171 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 [2024-11-09 06:29:10,474 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:29:10,474 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 [2024-11-09 06:29:10,487 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 [2024-11-09 06:29:10,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:29:10,756 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 [2024-11-09 06:29:10,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-09 06:29:11,049 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:29:11,050 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 [2024-11-09 06:29:11,061 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 [2024-11-09 06:29:11,143 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 [2024-11-09 06:29:11,154 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 [2024-11-09 06:29:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:29:11,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:29:11,855 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11237 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2024-11-09 06:29:11,987 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11234))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11235) .cse0 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11235) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-09 06:29:12,074 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11234))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11235) .cse1 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11235) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse4) (bvadd (_ bv24 32) .cse4))))))) is different from false [2024-11-09 06:29:12,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11232))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11234))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11233) .cse0 v_ArrVal_11235) .cse1 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11232))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11233) .cse6 v_ArrVal_11235) (select (select (store .cse7 .cse6 v_ArrVal_11234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11236))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-09 06:29:13,149 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_11232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11232))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11233) .cse2 v_ArrVal_11235) (select (select (store .cse3 .cse2 v_ArrVal_11234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11236))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11237 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11232))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11234))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11233) .cse5 v_ArrVal_11235) .cse6 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 06:29:15,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11328))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11232))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11234))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11329) .cse0 v_ArrVal_11233) .cse1 v_ArrVal_11235) .cse2 v_ArrVal_11236) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_11237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_11232 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11236 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11233 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11329 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11328))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11232))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11329) .cse8 v_ArrVal_11233) .cse9 v_ArrVal_11235) (select (select (store .cse10 .cse9 v_ArrVal_11234) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11236))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse7) (bvadd (_ bv24 32) .cse7)))))) is different from false [2024-11-09 06:29:15,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:29:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124324555] [2024-11-09 06:29:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124324555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:29:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1620647937] [2024-11-09 06:29:15,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:29:15,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:29:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:29:15,855 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:29:15,856 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2024-11-09 06:30:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:12,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 120 conjuncts are in the unsatisfiable core [2024-11-09 06:30:12,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:12,467 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 [2024-11-09 06:30:13,120 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:30:13,120 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 [2024-11-09 06:30:13,144 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 [2024-11-09 06:30:13,192 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 [2024-11-09 06:30:13,204 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 [2024-11-09 06:30:13,400 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 [2024-11-09 06:30:13,412 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 [2024-11-09 06:30:15,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:15,490 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 [2024-11-09 06:30:15,503 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 [2024-11-09 06:30:15,735 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:15,735 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 [2024-11-09 06:30:15,748 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 [2024-11-09 06:30:15,919 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:15,919 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 [2024-11-09 06:30:15,932 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 [2024-11-09 06:30:16,105 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:16,105 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 [2024-11-09 06:30:16,117 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 [2024-11-09 06:30:16,201 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 [2024-11-09 06:30:16,212 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 [2024-11-09 06:30:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:30:16,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:30:16,341 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2024-11-09 06:30:16,393 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2024-11-09 06:30:16,477 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11831))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11832) .cse0 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11832) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd (_ bv24 32) .cse3)))))) is different from false [2024-11-09 06:30:16,573 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11832) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11831))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11832) .cse3 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:30:16,853 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11830))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11829) .cse1 v_ArrVal_11832) (select (select (store .cse2 .cse1 v_ArrVal_11831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11834))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_11829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11830))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11831))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11829) .cse4 v_ArrVal_11832) .cse5 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2024-11-09 06:30:18,004 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_11829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11830))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11829) .cse2 v_ArrVal_11832) (select (select (store .cse3 .cse2 v_ArrVal_11831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11834))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11830))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_11831))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11829) .cse5 v_ArrVal_11832) .cse6 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2024-11-09 06:30:20,308 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11926))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_11830))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11925) .cse1 v_ArrVal_11829) .cse2 v_ArrVal_11832) (select (select (store .cse3 .cse2 v_ArrVal_11831) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11834))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_11829 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11831 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11832 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11925 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11926 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11926))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_11830))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_11831))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_11925) .cse6 v_ArrVal_11829) .cse7 v_ArrVal_11832) .cse8 v_ArrVal_11834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_11833) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-09 06:30:20,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1620647937] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:20,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494870824] [2024-11-09 06:30:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:30:20,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:30:20,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:30:20,330 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:30:20,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2024-11-09 06:30:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:30:21,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 118 conjuncts are in the unsatisfiable core [2024-11-09 06:30:21,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:30:21,358 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 [2024-11-09 06:30:21,843 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 [2024-11-09 06:30:21,894 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:30:21,895 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 [2024-11-09 06:30:21,919 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 [2024-11-09 06:30:21,941 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 [2024-11-09 06:30:22,123 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 [2024-11-09 06:30:22,134 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 [2024-11-09 06:30:24,266 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:24,267 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 [2024-11-09 06:30:24,279 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 [2024-11-09 06:30:24,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:24,484 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 [2024-11-09 06:30:24,496 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 [2024-11-09 06:30:24,662 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:24,662 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 [2024-11-09 06:30:24,675 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 [2024-11-09 06:30:24,845 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:30:24,846 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 [2024-11-09 06:30:24,880 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 [2024-11-09 06:30:24,965 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 [2024-11-09 06:30:24,977 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 [2024-11-09 06:30:24,991 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:30:24,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:30:25,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:30:25,164 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd (_ bv24 32) .cse2))))))) is different from false [2024-11-09 06:30:25,301 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12428) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12429))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12428) .cse2 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2024-11-09 06:30:25,393 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12428) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12429))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12428) .cse3 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2024-11-09 06:30:26,120 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12427))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_12429))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12426) .cse0 v_ArrVal_12428) .cse1 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12427))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12426) .cse6 v_ArrVal_12428) (select (select (store .cse7 .cse6 v_ArrVal_12429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12430))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd (_ bv24 32) .cse5)))))) is different from false [2024-11-09 06:30:26,610 WARN L851 $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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12427))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12429))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12426) .cse1 v_ArrVal_12428) .cse2 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12427))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12426) .cse7 v_ArrVal_12428) (select (select (store .cse8 .cse7 v_ArrVal_12429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12430))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2024-11-09 06:30:31,185 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12523))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_12427))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12522) .cse1 v_ArrVal_12426) .cse2 v_ArrVal_12428) (select (select (store .cse3 .cse2 v_ArrVal_12429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12430))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_12429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12523))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_12427))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_12429))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_12522) .cse6 v_ArrVal_12426) .cse7 v_ArrVal_12428) .cse8 v_ArrVal_12430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_12431) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2024-11-09 06:30:31,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494870824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:30:31,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:30:31,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2024-11-09 06:30:31,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299914559] [2024-11-09 06:30:31,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:30:31,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 06:30:31,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:30:31,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 06:30:31,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=188, Unknown=23, NotChecked=900, Total=1190 [2024-11-09 06:30:31,212 INFO L87 Difference]: Start difference. First operand 1183 states and 1445 transitions. Second operand has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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) [2024-11-09 06:32:34,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 06:32:34,933 INFO L93 Difference]: Finished difference Result 1190 states and 1452 transitions. [2024-11-09 06:32:34,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 06:32:34,934 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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 127 [2024-11-09 06:32:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 06:32:34,936 INFO L225 Difference]: With dead ends: 1190 [2024-11-09 06:32:34,936 INFO L226 Difference]: Without dead ends: 1190 [2024-11-09 06:32:34,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 379 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=125, Invalid=394, Unknown=23, NotChecked=1180, Total=1722 [2024-11-09 06:32:34,937 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 793 mSDsluCounter, 3287 mSDsCounter, 0 mSdLazyCounter, 5912 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 118.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 3841 SdHoareTripleChecker+Invalid, 5919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 120.8s IncrementalHoareTripleChecker+Time [2024-11-09 06:32:34,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 3841 Invalid, 5919 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [7 Valid, 5912 Invalid, 0 Unknown, 0 Unchecked, 120.8s Time] [2024-11-09 06:32:34,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-09 06:32:34,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1182. [2024-11-09 06:32:34,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 807 states have (on average 1.7311028500619579) internal successors, (1397), 1169 states have internal predecessors, (1397), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-11-09 06:32:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1444 transitions. [2024-11-09 06:32:34,969 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1444 transitions. Word has length 127 [2024-11-09 06:32:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 06:32:34,969 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1444 transitions. [2024-11-09 06:32:34,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 8.3) internal successors, (83), 12 states have internal predecessors, (83), 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) [2024-11-09 06:32:34,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1444 transitions. [2024-11-09 06:32:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 06:32:34,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 06:32:34,973 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:32:34,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2024-11-09 06:32:35,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2024-11-09 06:32:35,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2024-11-09 06:32:35,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt [2024-11-09 06:32:35,574 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-11-09 06:32:35,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:32:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash -670984983, now seen corresponding path program 1 times [2024-11-09 06:32:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-09 06:32:35,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703158636] [2024-11-09 06:32:35,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:32:35,575 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 [2024-11-09 06:32:35,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat [2024-11-09 06:32:35,576 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -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) [2024-11-09 06:32:35,578 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2024-11-09 06:32:37,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:32:37,205 INFO L255 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-11-09 06:32:37,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:32:37,251 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 [2024-11-09 06:32:39,839 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:32:39,840 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 [2024-11-09 06:32:40,165 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 [2024-11-09 06:32:41,334 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 [2024-11-09 06:32:50,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:50,898 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 [2024-11-09 06:32:52,008 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:52,008 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 [2024-11-09 06:32:53,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:53,175 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 [2024-11-09 06:32:54,276 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:54,276 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 [2024-11-09 06:32:55,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:32:55,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:32:55,731 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 [2024-11-09 06:32:56,985 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-09 06:32:56,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 06:32:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:32:57,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:32:58,517 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_12997) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2024-11-09 06:32:58,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_12997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:32:58,773 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (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$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12996))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:32:58,875 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12996))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:32:59,018 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12995 (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$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12995))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12996)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:32:59,121 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12995 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12995))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12996)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2024-11-09 06:32:59,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12995 (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$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12994))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12995)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12996)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2024-11-09 06:32:59,385 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12995 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12994))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12995)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12996)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:02,011 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12994 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12996 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12995 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13044 (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 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_13044))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12994)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12995)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12996)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:02,036 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-09 06:33:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703158636] [2024-11-09 06:33:02,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703158636] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:02,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [947622171] [2024-11-09 06:33:02,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:02,036 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 06:33:02,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 [2024-11-09 06:33:02,038 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 06:33:02,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2024-11-09 06:33:25,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:25,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 06:33:25,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:25,389 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 [2024-11-09 06:33:28,003 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 06:33:28,004 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 [2024-11-09 06:33:28,167 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 [2024-11-09 06:33:28,835 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 [2024-11-09 06:33:41,074 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:33:41,075 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 [2024-11-09 06:33:41,847 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:33:41,847 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 [2024-11-09 06:33:42,499 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:33:42,500 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 [2024-11-09 06:33:43,290 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:33:43,291 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 [2024-11-09 06:33:43,945 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:33:43,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 06:33:44,189 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 [2024-11-09 06:33:45,033 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2024-11-09 06:33:45,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 06:33:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:33:45,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:33:46,643 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_13518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 06:33:46,784 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13517 (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$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_13517))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:46,873 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13517 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13517))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:47,007 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13516 (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$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_13516))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13517)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:47,101 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13516 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13516))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13517)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:47,248 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13516 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_13515))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13516)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13517)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:47,352 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13516 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13515))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13516)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13517)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2024-11-09 06:33:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [947622171] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:33:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219518551] [2024-11-09 06:33:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:33:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 06:33:50,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 06:33:50,518 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 06:33:50,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7c957422-fd3b-49a7-8e2c-8eae1bcf0c7c/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2024-11-09 06:33:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:33:51,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-09 06:33:51,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 06:33:51,687 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 [2024-11-09 06:33:53,961 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 06:33:53,961 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 [2024-11-09 06:33:54,505 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 [2024-11-09 06:33:59,752 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:33:59,752 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 31 treesize of output 32 [2024-11-09 06:34:00,679 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:34:00,680 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 31 treesize of output 32 [2024-11-09 06:34:01,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:34:01,601 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 31 treesize of output 32 [2024-11-09 06:34:02,562 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:34:02,562 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 31 treesize of output 32 [2024-11-09 06:34:03,614 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 06:34:03,614 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 [2024-11-09 06:34:04,444 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 [2024-11-09 06:34:04,887 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 06:34:04,888 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 21 treesize of output 20 [2024-11-09 06:34:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 06:34:04,926 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 06:34:05,757 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2024-11-09 06:34:05,758 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 [2024-11-09 06:34:05,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem41#1.base|)) is different from false [2024-11-09 06:34:05,912 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 06:34:06,041 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_14037)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2024-11-09 06:34:06,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14037))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:34:06,263 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_14036))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14037)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:34:06,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14036))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14037)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:34:06,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_14035))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14036)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14037)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:34:06,605 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14035))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14036)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14037)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 06:34:09,159 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_14085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14038 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14035 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14037 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_14036 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_14085))) (store .cse5 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14035)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14036)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_14037)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_14038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 06:34:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219518551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 06:34:09,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 06:34:09,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 25 [2024-11-09 06:34:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888945049] [2024-11-09 06:34:09,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 06:34:09,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 06:34:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-09 06:34:09,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 06:34:09,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=715, Unknown=33, NotChecked=1950, Total=2862 [2024-11-09 06:34:09,184 INFO L87 Difference]: Start difference. First operand 1182 states and 1444 transitions. Second operand has 26 states, 23 states have (on average 5.260869565217392) internal successors, (121), 26 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3)