./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:42:54,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:42:54,170 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:42:54,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:42:54,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:42:54,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:42:54,200 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:42:54,200 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:42:54,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:42:54,201 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:42:54,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:42:54,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:42:54,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:42:54,204 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:42:54,204 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:42:54,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:42:54,205 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:42:54,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:42:54,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:42:54,207 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:42:54,207 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:42:54,208 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:42:54,208 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:42:54,209 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:42:54,209 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:42:54,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:42:54,210 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:42:54,210 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:42:54,211 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:42:54,211 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:42:54,212 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:42:54,212 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:42:54,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:42:54,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:42:54,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:42:54,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:42:54,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:42:54,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:42:54,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:42:54,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:42:54,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:42:54,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2023-11-29 01:42:54,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:42:54,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:42:54,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:42:54,484 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:42:54,484 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:42:54,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2023-11-29 01:42:57,223 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:42:57,494 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:42:57,494 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2023-11-29 01:42:57,516 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data/be0384523/a3632d7a12ba4539a35867fde1258f09/FLAGe1d359b42 [2023-11-29 01:42:57,531 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data/be0384523/a3632d7a12ba4539a35867fde1258f09 [2023-11-29 01:42:57,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:42:57,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:42:57,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:42:57,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:42:57,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:42:57,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:42:57" (1/1) ... [2023-11-29 01:42:57,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1053e3a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:57, skipping insertion in model container [2023-11-29 01:42:57,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:42:57" (1/1) ... [2023-11-29 01:42:57,607 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:42:58,066 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:42:58,077 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 01:42:58,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4712cb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:42:58, skipping insertion in model container [2023-11-29 01:42:58,078 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:42:58,078 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 01:42:58,080 INFO L158 Benchmark]: Toolchain (without parser) took 544.00ms. Allocated memory is still 138.4MB. Free memory was 96.9MB in the beginning and 77.3MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 01:42:58,080 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 138.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:42:58,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.57ms. Allocated memory is still 138.4MB. Free memory was 96.9MB in the beginning and 77.3MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 01:42:58,083 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.21ms. Allocated memory is still 138.4MB. Free memory is still 109.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 541.57ms. Allocated memory is still 138.4MB. Free memory was 96.9MB in the beginning and 77.3MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:42:59,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:42:59,847 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:42:59,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:42:59,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:42:59,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:42:59,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:42:59,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:42:59,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:42:59,890 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:42:59,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:42:59,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:42:59,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:42:59,892 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:42:59,893 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:42:59,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:42:59,894 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:42:59,895 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:42:59,895 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:42:59,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:42:59,896 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:42:59,897 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:42:59,897 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:42:59,898 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:42:59,898 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:42:59,899 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:42:59,899 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:42:59,899 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:42:59,900 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:42:59,900 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:42:59,901 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:42:59,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:42:59,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:42:59,902 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:42:59,902 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:42:59,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:42:59,903 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:42:59,903 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:42:59,903 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:42:59,903 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:42:59,903 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:42:59,904 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:42:59,904 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:42:59,904 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:42:59,904 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2023-11-29 01:43:00,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:43:00,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:43:00,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:43:00,203 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:43:00,203 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:43:00,204 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2023-11-29 01:43:02,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:43:03,267 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:43:03,267 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2023-11-29 01:43:03,284 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data/4b062bcc0/851fa8df8a7b45e99ada77f2756bd735/FLAGed8504257 [2023-11-29 01:43:03,297 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/data/4b062bcc0/851fa8df8a7b45e99ada77f2756bd735 [2023-11-29 01:43:03,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:43:03,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:43:03,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:43:03,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:43:03,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:43:03,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:43:03" (1/1) ... [2023-11-29 01:43:03,308 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdfcb5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:03, skipping insertion in model container [2023-11-29 01:43:03,308 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:43:03" (1/1) ... [2023-11-29 01:43:03,386 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:43:03,811 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:43:03,825 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 01:43:03,837 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:43:03,909 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:43:03,924 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:43:03,988 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:43:04,017 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 01:43:04,023 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:43:04,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04 WrapperNode [2023-11-29 01:43:04,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:43:04,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:43:04,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:43:04,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:43:04,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,125 INFO L138 Inliner]: procedures = 180, calls = 299, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1017 [2023-11-29 01:43:04,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:43:04,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:43:04,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:43:04,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:43:04,137 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,147 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,231 INFO L175 MemorySlicer]: Split 261 memory accesses to 4 slices as follows [2, 34, 5, 220]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 4, 1, 50]. [2023-11-29 01:43:04,231 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,231 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,293 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,299 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:43:04,319 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:43:04,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:43:04,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:43:04,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (1/1) ... [2023-11-29 01:43:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:43:04,343 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:43:04,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:43:04,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:43:04,407 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 01:43:04,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 01:43:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 01:43:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 01:43:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 01:43:04,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 01:43:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:43:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:43:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:43:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 01:43:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 01:43:04,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 01:43:04,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 01:43:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 01:43:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 01:43:04,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 01:43:04,410 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 01:43:04,410 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 01:43:04,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 01:43:04,411 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 01:43:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2023-11-29 01:43:04,411 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2023-11-29 01:43:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:43:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:43:04,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:43:04,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 01:43:04,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:43:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:43:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:43:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 01:43:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:43:04,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:43:04,622 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:43:04,624 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:43:04,652 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:43:04,684 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:43:04,706 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:43:04,727 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:43:08,975 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:43:09,151 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:43:09,151 INFO L309 CfgBuilder]: Removed 62 assume(true) statements. [2023-11-29 01:43:09,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:43:09 BoogieIcfgContainer [2023-11-29 01:43:09,152 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:43:09,155 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:43:09,155 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:43:09,158 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:43:09,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:43:03" (1/3) ... [2023-11-29 01:43:09,159 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764baf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:43:09, skipping insertion in model container [2023-11-29 01:43:09,159 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:43:04" (2/3) ... [2023-11-29 01:43:09,160 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@764baf93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:43:09, skipping insertion in model container [2023-11-29 01:43:09,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:43:09" (3/3) ... [2023-11-29 01:43:09,161 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2023-11-29 01:43:09,179 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:43:09,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 535 error locations. [2023-11-29 01:43:09,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:43:09,266 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@411c1138, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:43:09,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 535 error locations. [2023-11-29 01:43:09,279 INFO L276 IsEmpty]: Start isEmpty. Operand has 1004 states, 445 states have (on average 2.5033707865168537) internal successors, (1114), 994 states have internal predecessors, (1114), 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) [2023-11-29 01:43:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 01:43:09,288 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:09,288 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 01:43:09,289 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:09,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash 61214, now seen corresponding path program 1 times [2023-11-29 01:43:09,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:09,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785041714] [2023-11-29 01:43:09,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:09,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:09,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:09,321 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:09,356 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 01:43:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:09,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:43:09,518 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:09,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:43:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:09,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:09,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:09,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785041714] [2023-11-29 01:43:09,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785041714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:09,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:09,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:43:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300121148] [2023-11-29 01:43:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:09,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:09,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:09,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:09,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:09,646 INFO L87 Difference]: Start difference. First operand has 1004 states, 445 states have (on average 2.5033707865168537) internal successors, (1114), 994 states have internal predecessors, (1114), 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.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:12,852 INFO L93 Difference]: Finished difference Result 1358 states and 1474 transitions. [2023-11-29 01:43:12,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 01:43:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:12,884 INFO L225 Difference]: With dead ends: 1358 [2023-11-29 01:43:12,885 INFO L226 Difference]: Without dead ends: 1357 [2023-11-29 01:43:12,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:12,889 INFO L413 NwaCegarLoop]: 818 mSDtfsCounter, 394 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:12,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1360 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 01:43:12,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2023-11-29 01:43:12,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1165. [2023-11-29 01:43:12,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 613 states have (on average 2.3278955954323) internal successors, (1427), 1154 states have internal predecessors, (1427), 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) [2023-11-29 01:43:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1471 transitions. [2023-11-29 01:43:12,977 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1471 transitions. Word has length 2 [2023-11-29 01:43:12,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:12,978 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1471 transitions. [2023-11-29 01:43:12,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:12,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1471 transitions. [2023-11-29 01:43:12,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 01:43:12,978 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:12,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 01:43:12,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:43:13,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:13,180 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:13,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:13,180 INFO L85 PathProgramCache]: Analyzing trace with hash 61213, now seen corresponding path program 1 times [2023-11-29 01:43:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968135135] [2023-11-29 01:43:13,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:13,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:13,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:13,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:13,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 01:43:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:13,299 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:43:13,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:13,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:43:13,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:13,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:13,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:13,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968135135] [2023-11-29 01:43:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968135135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:13,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:13,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:43:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834726160] [2023-11-29 01:43:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:13,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:13,322 INFO L87 Difference]: Start difference. First operand 1165 states and 1471 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:14,963 INFO L93 Difference]: Finished difference Result 1186 states and 1492 transitions. [2023-11-29 01:43:14,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:14,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 01:43:14,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:14,970 INFO L225 Difference]: With dead ends: 1186 [2023-11-29 01:43:14,970 INFO L226 Difference]: Without dead ends: 1186 [2023-11-29 01:43:14,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:14,972 INFO L413 NwaCegarLoop]: 591 mSDtfsCounter, 884 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:14,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 713 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 01:43:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2023-11-29 01:43:14,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1168. [2023-11-29 01:43:15,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 624 states have (on average 2.2916666666666665) internal successors, (1430), 1156 states have internal predecessors, (1430), 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) [2023-11-29 01:43:15,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1476 transitions. [2023-11-29 01:43:15,006 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1476 transitions. Word has length 2 [2023-11-29 01:43:15,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:15,006 INFO L495 AbstractCegarLoop]: Abstraction has 1168 states and 1476 transitions. [2023-11-29 01:43:15,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1476 transitions. [2023-11-29 01:43:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 01:43:15,007 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:15,007 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 01:43:15,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 01:43:15,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:15,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:15,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash 700555751, now seen corresponding path program 1 times [2023-11-29 01:43:15,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:15,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939089867] [2023-11-29 01:43:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:15,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:15,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:15,211 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:15,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 01:43:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:15,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:43:15,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:15,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:43:15,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:43:15,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:43:15,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:43:15,446 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:43:15,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:43:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:15,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:15,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:15,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939089867] [2023-11-29 01:43:15,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939089867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:15,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:15,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:15,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13968948] [2023-11-29 01:43:15,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:15,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:15,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:15,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:15,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:15,484 INFO L87 Difference]: Start difference. First operand 1168 states and 1476 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:18,131 INFO L93 Difference]: Finished difference Result 1175 states and 1481 transitions. [2023-11-29 01:43:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 01:43:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:18,138 INFO L225 Difference]: With dead ends: 1175 [2023-11-29 01:43:18,138 INFO L226 Difference]: Without dead ends: 1175 [2023-11-29 01:43:18,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:18,140 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 1851 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1857 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:18,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1857 Valid, 417 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 01:43:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-11-29 01:43:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 984. [2023-11-29 01:43:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 984 states, 451 states have (on average 2.2838137472283813) internal successors, (1030), 973 states have internal predecessors, (1030), 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) [2023-11-29 01:43:18,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1074 transitions. [2023-11-29 01:43:18,180 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1074 transitions. Word has length 6 [2023-11-29 01:43:18,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:18,181 INFO L495 AbstractCegarLoop]: Abstraction has 984 states and 1074 transitions. [2023-11-29 01:43:18,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1074 transitions. [2023-11-29 01:43:18,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:43:18,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:18,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:18,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:43:18,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:18,385 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:18,386 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:18,386 INFO L85 PathProgramCache]: Analyzing trace with hash 242391905, now seen corresponding path program 1 times [2023-11-29 01:43:18,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:18,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691149617] [2023-11-29 01:43:18,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:18,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:18,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:18,387 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:18,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 01:43:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:18,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:43:18,505 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:18,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:43:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:18,520 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:18,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:18,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691149617] [2023-11-29 01:43:18,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691149617] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:18,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:18,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:18,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089290489] [2023-11-29 01:43:18,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:18,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:18,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:18,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:18,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:18,522 INFO L87 Difference]: Start difference. First operand 984 states and 1074 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:20,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:20,567 INFO L93 Difference]: Finished difference Result 1280 states and 1398 transitions. [2023-11-29 01:43:20,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:20,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 01:43:20,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:20,574 INFO L225 Difference]: With dead ends: 1280 [2023-11-29 01:43:20,574 INFO L226 Difference]: Without dead ends: 1280 [2023-11-29 01:43:20,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:20,575 INFO L413 NwaCegarLoop]: 832 mSDtfsCounter, 895 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 900 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:20,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [900 Valid, 1107 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 01:43:20,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2023-11-29 01:43:20,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 937. [2023-11-29 01:43:20,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 451 states have (on average 2.1773835920177382) internal successors, (982), 926 states have internal predecessors, (982), 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) [2023-11-29 01:43:20,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1026 transitions. [2023-11-29 01:43:20,603 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1026 transitions. Word has length 7 [2023-11-29 01:43:20,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:20,604 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1026 transitions. [2023-11-29 01:43:20,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:20,604 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1026 transitions. [2023-11-29 01:43:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 01:43:20,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:20,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:20,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:43:20,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:20,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:20,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 242391906, now seen corresponding path program 1 times [2023-11-29 01:43:20,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:20,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [132921891] [2023-11-29 01:43:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:20,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 [2023-11-29 01:43:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:20,809 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:20,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 01:43:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:20,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:43:20,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:20,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:43:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:20,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:20,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [132921891] [2023-11-29 01:43:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [132921891] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:20,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:20,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:20,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498061233] [2023-11-29 01:43:20,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:20,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:20,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:20,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:20,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:20,945 INFO L87 Difference]: Start difference. First operand 937 states and 1026 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:23,767 INFO L93 Difference]: Finished difference Result 1365 states and 1488 transitions. [2023-11-29 01:43:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:23,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 01:43:23,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:23,773 INFO L225 Difference]: With dead ends: 1365 [2023-11-29 01:43:23,773 INFO L226 Difference]: Without dead ends: 1365 [2023-11-29 01:43:23,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:23,774 INFO L413 NwaCegarLoop]: 1015 mSDtfsCounter, 626 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:23,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 1427 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 01:43:23,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2023-11-29 01:43:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1139. [2023-11-29 01:43:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 661 states have (on average 2.172465960665658) internal successors, (1436), 1126 states have internal predecessors, (1436), 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) [2023-11-29 01:43:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1484 transitions. [2023-11-29 01:43:23,798 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1484 transitions. Word has length 7 [2023-11-29 01:43:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:23,799 INFO L495 AbstractCegarLoop]: Abstraction has 1139 states and 1484 transitions. [2023-11-29 01:43:23,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1484 transitions. [2023-11-29 01:43:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 01:43:23,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:23,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:23,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 01:43:24,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:24,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr533ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:24,002 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:24,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1826468921, now seen corresponding path program 1 times [2023-11-29 01:43:24,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:24,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936371185] [2023-11-29 01:43:24,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:24,003 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:24,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:24,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:24,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 01:43:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:24,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:43:24,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:24,178 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:43:24,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:43:24,179 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:43:24,183 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 [2023-11-29 01:43:24,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:43:24,238 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 [2023-11-29 01:43:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:24,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:24,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936371185] [2023-11-29 01:43:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936371185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:24,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:24,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:43:24,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671999166] [2023-11-29 01:43:24,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:24,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:24,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:24,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:24,255 INFO L87 Difference]: Start difference. First operand 1139 states and 1484 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:26,111 INFO L93 Difference]: Finished difference Result 2226 states and 2887 transitions. [2023-11-29 01:43:26,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:26,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 01:43:26,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:26,121 INFO L225 Difference]: With dead ends: 2226 [2023-11-29 01:43:26,121 INFO L226 Difference]: Without dead ends: 2226 [2023-11-29 01:43:26,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:26,122 INFO L413 NwaCegarLoop]: 877 mSDtfsCounter, 909 mSDsluCounter, 1746 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 2623 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:26,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 2623 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 01:43:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2023-11-29 01:43:26,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 1141. [2023-11-29 01:43:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 663 states have (on average 2.1689291101055805) internal successors, (1438), 1128 states have internal predecessors, (1438), 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) [2023-11-29 01:43:26,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1486 transitions. [2023-11-29 01:43:26,149 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1486 transitions. Word has length 9 [2023-11-29 01:43:26,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:26,149 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1486 transitions. [2023-11-29 01:43:26,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:26,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1486 transitions. [2023-11-29 01:43:26,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 01:43:26,150 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:26,150 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:26,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:43:26,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:26,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:26,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:26,351 INFO L85 PathProgramCache]: Analyzing trace with hash 994211192, now seen corresponding path program 1 times [2023-11-29 01:43:26,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:26,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1709721546] [2023-11-29 01:43:26,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:26,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:26,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:26,353 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:26,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 01:43:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:26,537 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:43:26,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:26,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:26,547 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:26,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:26,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1709721546] [2023-11-29 01:43:26,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1709721546] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:26,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:26,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:43:26,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173335439] [2023-11-29 01:43:26,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:26,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:26,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:26,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:26,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:26,549 INFO L87 Difference]: Start difference. First operand 1141 states and 1486 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:27,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:27,306 INFO L93 Difference]: Finished difference Result 1102 states and 1446 transitions. [2023-11-29 01:43:27,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:27,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 01:43:27,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:27,314 INFO L225 Difference]: With dead ends: 1102 [2023-11-29 01:43:27,314 INFO L226 Difference]: Without dead ends: 1102 [2023-11-29 01:43:27,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:27,315 INFO L413 NwaCegarLoop]: 848 mSDtfsCounter, 70 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1647 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:27,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1647 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:43:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2023-11-29 01:43:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 1102. [2023-11-29 01:43:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 648 states have (on average 2.1574074074074074) internal successors, (1398), 1089 states have internal predecessors, (1398), 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) [2023-11-29 01:43:27,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1446 transitions. [2023-11-29 01:43:27,341 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1446 transitions. Word has length 15 [2023-11-29 01:43:27,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:27,341 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1446 transitions. [2023-11-29 01:43:27,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:27,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1446 transitions. [2023-11-29 01:43:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 01:43:27,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:27,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:27,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 01:43:27,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:27,543 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:27,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1954216338, now seen corresponding path program 1 times [2023-11-29 01:43:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:27,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975612427] [2023-11-29 01:43:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:27,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:27,544 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:27,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 01:43:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:27,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:43:27,695 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:27,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:27,709 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:27,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975612427] [2023-11-29 01:43:27,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975612427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:27,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:27,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:43:27,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447471846] [2023-11-29 01:43:27,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:27,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:27,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:27,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:27,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:27,710 INFO L87 Difference]: Start difference. First operand 1102 states and 1446 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:28,622 INFO L93 Difference]: Finished difference Result 1088 states and 1425 transitions. [2023-11-29 01:43:28,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:28,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 01:43:28,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:28,629 INFO L225 Difference]: With dead ends: 1088 [2023-11-29 01:43:28,630 INFO L226 Difference]: Without dead ends: 1088 [2023-11-29 01:43:28,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:28,630 INFO L413 NwaCegarLoop]: 817 mSDtfsCounter, 58 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:28,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2427 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:43:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-29 01:43:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1087. [2023-11-29 01:43:28,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 647 states have (on average 2.126738794435858) internal successors, (1376), 1074 states have internal predecessors, (1376), 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) [2023-11-29 01:43:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1424 transitions. [2023-11-29 01:43:28,655 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1424 transitions. Word has length 17 [2023-11-29 01:43:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:28,656 INFO L495 AbstractCegarLoop]: Abstraction has 1087 states and 1424 transitions. [2023-11-29 01:43:28,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1424 transitions. [2023-11-29 01:43:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:43:28,657 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:28,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:28,661 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 01:43:28,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:28,858 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:28,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash 825439296, now seen corresponding path program 1 times [2023-11-29 01:43:28,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95526975] [2023-11-29 01:43:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:28,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:28,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:28,859 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:28,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 01:43:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:29,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:43:29,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:29,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:43:29,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:29,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:29,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:29,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95526975] [2023-11-29 01:43:29,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95526975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:29,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:29,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:43:29,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401091267] [2023-11-29 01:43:29,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:29,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:29,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:29,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:29,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:29,101 INFO L87 Difference]: Start difference. First operand 1087 states and 1424 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:31,148 INFO L93 Difference]: Finished difference Result 1097 states and 1436 transitions. [2023-11-29 01:43:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 01:43:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:31,153 INFO L225 Difference]: With dead ends: 1097 [2023-11-29 01:43:31,153 INFO L226 Difference]: Without dead ends: 1097 [2023-11-29 01:43:31,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:31,154 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 828 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:31,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 973 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 01:43:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2023-11-29 01:43:31,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1083. [2023-11-29 01:43:31,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 647 states have (on average 2.1205564142194744) internal successors, (1372), 1070 states have internal predecessors, (1372), 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) [2023-11-29 01:43:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1420 transitions. [2023-11-29 01:43:31,182 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1420 transitions. Word has length 31 [2023-11-29 01:43:31,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:31,182 INFO L495 AbstractCegarLoop]: Abstraction has 1083 states and 1420 transitions. [2023-11-29 01:43:31,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:31,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1420 transitions. [2023-11-29 01:43:31,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 01:43:31,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:31,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:31,187 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 01:43:31,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:31,384 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:31,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:31,385 INFO L85 PathProgramCache]: Analyzing trace with hash 825439297, now seen corresponding path program 1 times [2023-11-29 01:43:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:31,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146063391] [2023-11-29 01:43:31,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:31,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:31,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:31,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:31,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 01:43:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:31,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:43:31,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:31,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:43:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:31,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:31,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146063391] [2023-11-29 01:43:31,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146063391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:31,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:31,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:43:31,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646716037] [2023-11-29 01:43:31,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:31,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:31,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:31,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:31,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:31,724 INFO L87 Difference]: Start difference. First operand 1083 states and 1420 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:35,016 INFO L93 Difference]: Finished difference Result 1305 states and 1420 transitions. [2023-11-29 01:43:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:35,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 01:43:35,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:35,024 INFO L225 Difference]: With dead ends: 1305 [2023-11-29 01:43:35,025 INFO L226 Difference]: Without dead ends: 1305 [2023-11-29 01:43:35,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:35,026 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 561 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:35,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1464 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 01:43:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2023-11-29 01:43:35,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1079. [2023-11-29 01:43:35,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 647 states have (on average 2.114374034003091) internal successors, (1368), 1066 states have internal predecessors, (1368), 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) [2023-11-29 01:43:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1416 transitions. [2023-11-29 01:43:35,051 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1416 transitions. Word has length 31 [2023-11-29 01:43:35,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:35,051 INFO L495 AbstractCegarLoop]: Abstraction has 1079 states and 1416 transitions. [2023-11-29 01:43:35,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1416 transitions. [2023-11-29 01:43:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 01:43:35,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:35,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:35,057 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 01:43:35,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:35,254 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:35,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1214282682, now seen corresponding path program 1 times [2023-11-29 01:43:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:35,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523945686] [2023-11-29 01:43:35,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:35,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:35,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:35,256 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:35,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 01:43:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:35,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:43:35,460 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:35,496 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:35,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:35,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523945686] [2023-11-29 01:43:35,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523945686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:35,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:35,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:43:35,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051375729] [2023-11-29 01:43:35,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:35,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:35,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:35,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:35,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:35,498 INFO L87 Difference]: Start difference. First operand 1079 states and 1416 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:36,450 INFO L93 Difference]: Finished difference Result 1073 states and 1406 transitions. [2023-11-29 01:43:36,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:36,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 01:43:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:36,457 INFO L225 Difference]: With dead ends: 1073 [2023-11-29 01:43:36,457 INFO L226 Difference]: Without dead ends: 1073 [2023-11-29 01:43:36,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:36,458 INFO L413 NwaCegarLoop]: 811 mSDtfsCounter, 23 mSDsluCounter, 1602 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2413 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:36,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2413 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:43:36,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2023-11-29 01:43:36,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 1073. [2023-11-29 01:43:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 641 states have (on average 2.1185647425897036) internal successors, (1358), 1060 states have internal predecessors, (1358), 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) [2023-11-29 01:43:36,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1406 transitions. [2023-11-29 01:43:36,474 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1406 transitions. Word has length 47 [2023-11-29 01:43:36,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:36,475 INFO L495 AbstractCegarLoop]: Abstraction has 1073 states and 1406 transitions. [2023-11-29 01:43:36,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:36,475 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1406 transitions. [2023-11-29 01:43:36,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 01:43:36,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:36,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:36,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 [2023-11-29 01:43:36,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:36,683 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:36,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:36,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1958359460, now seen corresponding path program 1 times [2023-11-29 01:43:36,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:36,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753525144] [2023-11-29 01:43:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:36,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:36,686 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:36,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 01:43:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:36,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:43:36,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:37,199 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:37,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:37,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753525144] [2023-11-29 01:43:37,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753525144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:37,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:37,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:43:37,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329451538] [2023-11-29 01:43:37,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:37,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:43:37,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:37,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:43:37,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:37,201 INFO L87 Difference]: Start difference. First operand 1073 states and 1406 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:38,294 INFO L93 Difference]: Finished difference Result 1557 states and 2086 transitions. [2023-11-29 01:43:38,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:43:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2023-11-29 01:43:38,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:38,302 INFO L225 Difference]: With dead ends: 1557 [2023-11-29 01:43:38,302 INFO L226 Difference]: Without dead ends: 1557 [2023-11-29 01:43:38,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:43:38,303 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 372 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:38,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 1685 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:43:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2023-11-29 01:43:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1381. [2023-11-29 01:43:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 947 states have (on average 2.0939809926082367) internal successors, (1983), 1366 states have internal predecessors, (1983), 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) [2023-11-29 01:43:38,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 2035 transitions. [2023-11-29 01:43:38,332 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 2035 transitions. Word has length 51 [2023-11-29 01:43:38,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:38,332 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 2035 transitions. [2023-11-29 01:43:38,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 2035 transitions. [2023-11-29 01:43:38,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 01:43:38,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:38,334 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:38,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 01:43:38,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:38,536 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:38,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:38,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1241740205, now seen corresponding path program 1 times [2023-11-29 01:43:38,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:38,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [454036452] [2023-11-29 01:43:38,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:38,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:38,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:38,538 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:38,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 01:43:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:38,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:43:38,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:38,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:43:38,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 7 [2023-11-29 01:43:39,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:43:39,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:43:39,260 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:43:39,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:43:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:39,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:39,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [454036452] [2023-11-29 01:43:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [454036452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:39,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:43:39,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034904250] [2023-11-29 01:43:39,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:39,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:39,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:39,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:39,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:39,272 INFO L87 Difference]: Start difference. First operand 1381 states and 2035 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:41,262 INFO L93 Difference]: Finished difference Result 1354 states and 2009 transitions. [2023-11-29 01:43:41,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:41,263 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 01:43:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:41,268 INFO L225 Difference]: With dead ends: 1354 [2023-11-29 01:43:41,268 INFO L226 Difference]: Without dead ends: 1354 [2023-11-29 01:43:41,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:41,269 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 1471 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:41,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 372 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 01:43:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2023-11-29 01:43:41,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 998. [2023-11-29 01:43:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 607 states have (on average 1.957166392092257) internal successors, (1188), 986 states have internal predecessors, (1188), 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) [2023-11-29 01:43:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1234 transitions. [2023-11-29 01:43:41,284 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1234 transitions. Word has length 54 [2023-11-29 01:43:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:41,284 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1234 transitions. [2023-11-29 01:43:41,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:43:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1234 transitions. [2023-11-29 01:43:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:43:41,285 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:41,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:41,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-29 01:43:41,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:41,492 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:41,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:41,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1040054284, now seen corresponding path program 1 times [2023-11-29 01:43:41,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:41,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543548198] [2023-11-29 01:43:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:41,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:41,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:41,494 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:41,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 01:43:41,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:41,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:43:41,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:41,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:43:41,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:43:41,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 01:43:41,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:41,790 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:41,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:41,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543548198] [2023-11-29 01:43:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1543548198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:41,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:43:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82308194] [2023-11-29 01:43:41,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:41,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:43:41,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:41,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:43:41,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:41,792 INFO L87 Difference]: Start difference. First operand 998 states and 1234 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 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) [2023-11-29 01:43:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:44,407 INFO L93 Difference]: Finished difference Result 997 states and 1233 transitions. [2023-11-29 01:43:44,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:43:44,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 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 [2023-11-29 01:43:44,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:44,413 INFO L225 Difference]: With dead ends: 997 [2023-11-29 01:43:44,413 INFO L226 Difference]: Without dead ends: 997 [2023-11-29 01:43:44,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:43:44,414 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 3 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:44,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2109 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 01:43:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2023-11-29 01:43:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2023-11-29 01:43:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 607 states have (on average 1.955518945634267) internal successors, (1187), 985 states have internal predecessors, (1187), 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) [2023-11-29 01:43:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1233 transitions. [2023-11-29 01:43:44,432 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1233 transitions. Word has length 58 [2023-11-29 01:43:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:44,432 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1233 transitions. [2023-11-29 01:43:44,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 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) [2023-11-29 01:43:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1233 transitions. [2023-11-29 01:43:44,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 01:43:44,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:44,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:44,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 01:43:44,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:44,635 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:44,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:44,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1040054285, now seen corresponding path program 1 times [2023-11-29 01:43:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960710124] [2023-11-29 01:43:44,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:44,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:44,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:44,637 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:44,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 01:43:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:44,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:43:44,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:44,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:43:44,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:43:44,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:43:45,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 01:43:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:45,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:45,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960710124] [2023-11-29 01:43:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960710124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:45,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:43:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296938449] [2023-11-29 01:43:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:45,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:43:45,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:43:45,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:45,035 INFO L87 Difference]: Start difference. First operand 997 states and 1233 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 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) [2023-11-29 01:43:48,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:48,380 INFO L93 Difference]: Finished difference Result 996 states and 1232 transitions. [2023-11-29 01:43:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:43:48,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 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 [2023-11-29 01:43:48,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:48,387 INFO L225 Difference]: With dead ends: 996 [2023-11-29 01:43:48,387 INFO L226 Difference]: Without dead ends: 996 [2023-11-29 01:43:48,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:43:48,388 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 1 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:48,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2154 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 01:43:48,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2023-11-29 01:43:48,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 996. [2023-11-29 01:43:48,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 606 states have (on average 1.9570957095709571) internal successors, (1186), 984 states have internal predecessors, (1186), 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) [2023-11-29 01:43:48,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1232 transitions. [2023-11-29 01:43:48,406 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1232 transitions. Word has length 58 [2023-11-29 01:43:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:48,407 INFO L495 AbstractCegarLoop]: Abstraction has 996 states and 1232 transitions. [2023-11-29 01:43:48,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 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) [2023-11-29 01:43:48,407 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1232 transitions. [2023-11-29 01:43:48,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 01:43:48,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:48,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:48,413 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 01:43:48,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:48,608 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:48,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash -327170704, now seen corresponding path program 1 times [2023-11-29 01:43:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:48,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039924288] [2023-11-29 01:43:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:48,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:48,609 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:48,610 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:48,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 01:43:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:48,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:43:48,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:48,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:48,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:43:48,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:48,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039924288] [2023-11-29 01:43:48,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039924288] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:43:48,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:43:48,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:43:48,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945609419] [2023-11-29 01:43:48,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:43:48,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:43:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:48,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:43:48,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:43:48,861 INFO L87 Difference]: Start difference. First operand 996 states and 1232 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:43:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:49,752 INFO L93 Difference]: Finished difference Result 998 states and 1235 transitions. [2023-11-29 01:43:49,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:43:49,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2023-11-29 01:43:49,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:49,760 INFO L225 Difference]: With dead ends: 998 [2023-11-29 01:43:49,760 INFO L226 Difference]: Without dead ends: 998 [2023-11-29 01:43:49,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:43:49,761 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 1 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2346 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:49,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2346 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:43:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2023-11-29 01:43:49,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 998. [2023-11-29 01:43:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 607 states have (on average 1.957166392092257) internal successors, (1188), 986 states have internal predecessors, (1188), 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) [2023-11-29 01:43:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1235 transitions. [2023-11-29 01:43:49,782 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1235 transitions. Word has length 64 [2023-11-29 01:43:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:49,782 INFO L495 AbstractCegarLoop]: Abstraction has 998 states and 1235 transitions. [2023-11-29 01:43:49,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:43:49,783 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1235 transitions. [2023-11-29 01:43:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 01:43:49,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:49,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:49,789 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 01:43:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:49,984 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:49,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1574536458, now seen corresponding path program 1 times [2023-11-29 01:43:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:49,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091965101] [2023-11-29 01:43:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:43:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:49,986 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:49,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 01:43:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:43:50,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:43:50,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:50,329 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:43:50,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:50,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091965101] [2023-11-29 01:43:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091965101] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:43:50,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:43:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 01:43:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154717387] [2023-11-29 01:43:50,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:43:50,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:43:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:43:50,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:43:50,397 INFO L87 Difference]: Start difference. First operand 998 states and 1235 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:43:51,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:51,471 INFO L93 Difference]: Finished difference Result 1007 states and 1249 transitions. [2023-11-29 01:43:51,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:43:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 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 65 [2023-11-29 01:43:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:51,478 INFO L225 Difference]: With dead ends: 1007 [2023-11-29 01:43:51,478 INFO L226 Difference]: Without dead ends: 1007 [2023-11-29 01:43:51,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:43:51,479 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 6 mSDsluCounter, 1562 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2344 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:51,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2344 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 01:43:51,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2023-11-29 01:43:51,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1006. [2023-11-29 01:43:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 614 states have (on average 1.9560260586319218) internal successors, (1201), 993 states have internal predecessors, (1201), 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) [2023-11-29 01:43:51,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1248 transitions. [2023-11-29 01:43:51,498 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1248 transitions. Word has length 65 [2023-11-29 01:43:51,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:51,499 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1248 transitions. [2023-11-29 01:43:51,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:43:51,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1248 transitions. [2023-11-29 01:43:51,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 01:43:51,500 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:51,500 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:51,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 01:43:51,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:51,701 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:51,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2068051696, now seen corresponding path program 2 times [2023-11-29 01:43:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:51,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904488736] [2023-11-29 01:43:51,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:43:51,702 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:51,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:51,702 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:51,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 01:43:52,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:43:52,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:43:52,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:43:52,108 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:52,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:43:52,281 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:52,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:52,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904488736] [2023-11-29 01:43:52,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904488736] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:43:52,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:43:52,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 01:43:52,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641616142] [2023-11-29 01:43:52,282 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:43:52,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:43:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:52,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:43:52,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:43:52,284 INFO L87 Difference]: Start difference. First operand 1006 states and 1248 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:43:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:43:54,378 INFO L93 Difference]: Finished difference Result 1021 states and 1270 transitions. [2023-11-29 01:43:54,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:43:54,378 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 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 68 [2023-11-29 01:43:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:43:54,382 INFO L225 Difference]: With dead ends: 1021 [2023-11-29 01:43:54,382 INFO L226 Difference]: Without dead ends: 1019 [2023-11-29 01:43:54,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 01:43:54,383 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 13 mSDsluCounter, 3905 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:43:54,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4687 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 01:43:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2023-11-29 01:43:54,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1015. [2023-11-29 01:43:54,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 623 states have (on average 1.9470304975922954) internal successors, (1213), 1002 states have internal predecessors, (1213), 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) [2023-11-29 01:43:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1260 transitions. [2023-11-29 01:43:54,399 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1260 transitions. Word has length 68 [2023-11-29 01:43:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:43:54,399 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1260 transitions. [2023-11-29 01:43:54,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:43:54,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1260 transitions. [2023-11-29 01:43:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 01:43:54,400 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:43:54,400 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:43:54,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-29 01:43:54,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:54,601 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:43:54,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:43:54,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2146608848, now seen corresponding path program 3 times [2023-11-29 01:43:54,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:43:54,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693042163] [2023-11-29 01:43:54,601 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:43:54,602 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:43:54,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:43:54,602 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:43:54,603 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 01:43:55,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 01:43:55,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:43:55,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:43:55,254 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:43:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:55,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:43:55,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:43:55,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:43:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693042163] [2023-11-29 01:43:55,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693042163] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:43:55,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:43:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 01:43:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989587532] [2023-11-29 01:43:55,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:43:55,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 01:43:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:43:55,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 01:43:55,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:43:55,971 INFO L87 Difference]: Start difference. First operand 1015 states and 1260 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:44:01,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:44:01,517 INFO L93 Difference]: Finished difference Result 1045 states and 1310 transitions. [2023-11-29 01:44:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 01:44:01,518 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 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 74 [2023-11-29 01:44:01,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:44:01,523 INFO L225 Difference]: With dead ends: 1045 [2023-11-29 01:44:01,523 INFO L226 Difference]: Without dead ends: 1042 [2023-11-29 01:44:01,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 01:44:01,525 INFO L413 NwaCegarLoop]: 781 mSDtfsCounter, 25 mSDsluCounter, 10135 mSDsCounter, 0 mSdLazyCounter, 2018 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10916 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:44:01,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10916 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2018 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 01:44:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2023-11-29 01:44:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1033. [2023-11-29 01:44:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 641 states have (on average 1.9282371294851794) internal successors, (1236), 1020 states have internal predecessors, (1236), 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) [2023-11-29 01:44:01,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1283 transitions. [2023-11-29 01:44:01,542 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1283 transitions. Word has length 74 [2023-11-29 01:44:01,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:44:01,542 INFO L495 AbstractCegarLoop]: Abstraction has 1033 states and 1283 transitions. [2023-11-29 01:44:01,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:44:01,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1283 transitions. [2023-11-29 01:44:01,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 01:44:01,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:44:01,543 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:44:01,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 01:44:01,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:44:01,744 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:44:01,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:01,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1323044272, now seen corresponding path program 4 times [2023-11-29 01:44:01,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:44:01,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470565465] [2023-11-29 01:44:01,745 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:44:01,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:44:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:44:01,746 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:44:01,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 01:44:02,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:44:02,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:44:02,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:44:02,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:44:02,495 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:44:02,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:44:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:44:04,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:44:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470565465] [2023-11-29 01:44:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470565465] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:44:04,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:44:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 01:44:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746177348] [2023-11-29 01:44:04,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:44:04,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 01:44:04,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:44:04,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 01:44:04,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 01:44:04,023 INFO L87 Difference]: Start difference. First operand 1033 states and 1283 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:44:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:44:16,818 INFO L93 Difference]: Finished difference Result 1090 states and 1372 transitions. [2023-11-29 01:44:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 01:44:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 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 86 [2023-11-29 01:44:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:44:16,824 INFO L225 Difference]: With dead ends: 1090 [2023-11-29 01:44:16,824 INFO L226 Difference]: Without dead ends: 1088 [2023-11-29 01:44:16,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 01:44:16,830 INFO L413 NwaCegarLoop]: 782 mSDtfsCounter, 48 mSDsluCounter, 17963 mSDsCounter, 0 mSdLazyCounter, 4573 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 18745 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 4573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:44:16,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 18745 Invalid, 4635 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [62 Valid, 4573 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2023-11-29 01:44:16,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-29 01:44:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1067. [2023-11-29 01:44:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 675 states have (on average 1.8992592592592592) internal successors, (1282), 1054 states have internal predecessors, (1282), 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) [2023-11-29 01:44:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1329 transitions. [2023-11-29 01:44:16,860 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1329 transitions. Word has length 86 [2023-11-29 01:44:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:44:16,860 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1329 transitions. [2023-11-29 01:44:16,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:44:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1329 transitions. [2023-11-29 01:44:16,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 01:44:16,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:44:16,861 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:44:16,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-29 01:44:17,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:44:17,062 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:44:17,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:44:17,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1011309072, now seen corresponding path program 5 times [2023-11-29 01:44:17,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:44:17,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255633669] [2023-11-29 01:44:17,063 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:44:17,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:44:17,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:44:17,064 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:44:17,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 01:44:18,340 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:44:18,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:44:18,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 01:44:18,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:44:18,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:44:18,460 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:44:18,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:44:18,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:44:18,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:44:19,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:44:19,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:44:19,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:44:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:44:19,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:44:19,898 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2000 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_2000) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:44:19,900 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:44:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255633669] [2023-11-29 01:44:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255633669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:44:19,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [155060397] [2023-11-29 01:44:19,900 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:44:19,900 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:44:19,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:44:19,901 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:44:19,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 01:45:20,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:45:20,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:45:20,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:45:20,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:45:20,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:45:20,827 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:45:20,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:45:20,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:45:20,994 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 20 treesize of output 12 [2023-11-29 01:45:21,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:45:21,833 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 36 treesize of output 35 [2023-11-29 01:45:21,907 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 27 treesize of output 15 [2023-11-29 01:45:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:45:21,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:45:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [155060397] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:45:26,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:45:26,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 01:45:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742960517] [2023-11-29 01:45:26,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:45:26,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:45:26,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:45:26,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:45:26,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=187, Unknown=2, NotChecked=28, Total=272 [2023-11-29 01:45:26,324 INFO L87 Difference]: Start difference. First operand 1067 states and 1329 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:45:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:45:34,674 INFO L93 Difference]: Finished difference Result 1484 states and 1868 transitions. [2023-11-29 01:45:34,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:45:34,676 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 01:45:34,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:45:34,681 INFO L225 Difference]: With dead ends: 1484 [2023-11-29 01:45:34,681 INFO L226 Difference]: Without dead ends: 1482 [2023-11-29 01:45:34,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=64, Invalid=210, Unknown=2, NotChecked=30, Total=306 [2023-11-29 01:45:34,682 INFO L413 NwaCegarLoop]: 461 mSDtfsCounter, 1092 mSDsluCounter, 2688 mSDsCounter, 0 mSdLazyCounter, 3447 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 3149 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:45:34,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 3149 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3447 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 01:45:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-11-29 01:45:34,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1066. [2023-11-29 01:45:34,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 675 states have (on average 1.891851851851852) internal successors, (1277), 1053 states have internal predecessors, (1277), 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) [2023-11-29 01:45:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1324 transitions. [2023-11-29 01:45:34,698 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1324 transitions. Word has length 108 [2023-11-29 01:45:34,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:45:34,698 INFO L495 AbstractCegarLoop]: Abstraction has 1066 states and 1324 transitions. [2023-11-29 01:45:34,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:45:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1324 transitions. [2023-11-29 01:45:34,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 01:45:34,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:45:34,699 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:45:34,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 01:45:34,908 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-29 01:45:35,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:45:35,100 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:45:35,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:45:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1011309071, now seen corresponding path program 1 times [2023-11-29 01:45:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:45:35,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223102824] [2023-11-29 01:45:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:45:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:45:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:45:35,102 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:45:35,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 01:45:35,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:45:35,797 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 01:45:35,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:45:35,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:45:35,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 [2023-11-29 01:45:35,953 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:45:35,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:45:35,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:45:35,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:45:36,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:45:36,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:45:36,862 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:45:36,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:45:36,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:45:36,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:45:36,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:45:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:45:36,963 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:45:38,363 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3017 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3017) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 01:45:38,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:45:38,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223102824] [2023-11-29 01:45:38,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223102824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:45:38,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [110177503] [2023-11-29 01:45:38,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:45:38,371 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:45:38,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:45:38,371 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:45:38,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 01:47:20,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:20,395 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 01:47:20,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:20,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:47:20,757 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:47:20,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:47:20,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:47:20,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:47:20,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:47:21,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 18 treesize of output 10 [2023-11-29 01:47:21,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:47:21,728 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:47:21,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:47:21,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:47:21,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:47:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:47:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:47:21,833 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:47:23,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:47:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [110177503] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:23,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:47:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 01:47:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869255959] [2023-11-29 01:47:23,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:47:23,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:47:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:47:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:47:23,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 01:47:23,144 INFO L87 Difference]: Start difference. First operand 1066 states and 1324 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:47:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:32,430 INFO L93 Difference]: Finished difference Result 1481 states and 1863 transitions. [2023-11-29 01:47:32,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:47:32,432 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 01:47:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:32,436 INFO L225 Difference]: With dead ends: 1481 [2023-11-29 01:47:32,436 INFO L226 Difference]: Without dead ends: 1481 [2023-11-29 01:47:32,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 01:47:32,437 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 1759 mSDsluCounter, 1548 mSDsCounter, 0 mSdLazyCounter, 3851 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 2008 SdHoareTripleChecker+Invalid, 3871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:32,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1764 Valid, 2008 Invalid, 3871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3851 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-11-29 01:47:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2023-11-29 01:47:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1065. [2023-11-29 01:47:32,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 675 states have (on average 1.8903703703703705) internal successors, (1276), 1052 states have internal predecessors, (1276), 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) [2023-11-29 01:47:32,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1323 transitions. [2023-11-29 01:47:32,458 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1323 transitions. Word has length 108 [2023-11-29 01:47:32,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:32,459 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1323 transitions. [2023-11-29 01:47:32,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:47:32,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1323 transitions. [2023-11-29 01:47:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:47:32,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:32,460 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:47:32,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 01:47:32,668 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 01:47:32,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:47:32,860 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:47:32,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1204040715, now seen corresponding path program 1 times [2023-11-29 01:47:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:47:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683017214] [2023-11-29 01:47:32,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:32,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:47:32,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:47:32,863 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:47:32,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 01:47:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:33,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 01:47:33,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:33,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:47:33,868 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:47:33,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:47:33,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:47:34,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:47:34,905 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:34,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:47:35,027 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:35,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:47:35,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:47:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:47:35,081 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:47:39,206 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3997 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3997) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:47:39,610 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3997 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4043 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4043))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3997)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:39,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:47:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683017214] [2023-11-29 01:47:39,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683017214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:39,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527529013] [2023-11-29 01:47:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:39,613 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:47:39,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:47:39,614 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:47:39,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 01:47:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:41,948 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:47:41,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:41,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 [2023-11-29 01:47:42,313 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:47:42,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:47:42,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:47:42,562 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 20 treesize of output 12 [2023-11-29 01:47:43,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:47:43,412 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 36 treesize of output 35 [2023-11-29 01:47:43,567 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:47:43,567 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 36 treesize of output 35 [2023-11-29 01:47:43,579 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 27 treesize of output 15 [2023-11-29 01:47:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:47:43,588 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:47:43,604 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4467) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:47:43,615 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4467) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:47:44,005 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4513 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4467 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4513))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4467)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:47:44,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [527529013] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:44,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:47:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:47:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144914659] [2023-11-29 01:47:44,009 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:47:44,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:47:44,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:47:44,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:47:44,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=244, Unknown=6, NotChecked=180, Total=506 [2023-11-29 01:47:44,010 INFO L87 Difference]: Start difference. First operand 1065 states and 1323 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:47:52,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:47:52,624 INFO L93 Difference]: Finished difference Result 1480 states and 1862 transitions. [2023-11-29 01:47:52,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:47:52,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 01:47:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:47:52,628 INFO L225 Difference]: With dead ends: 1480 [2023-11-29 01:47:52,629 INFO L226 Difference]: Without dead ends: 1480 [2023-11-29 01:47:52,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=85, Invalid=271, Unknown=6, NotChecked=190, Total=552 [2023-11-29 01:47:52,629 INFO L413 NwaCegarLoop]: 460 mSDtfsCounter, 1083 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 3887 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:47:52,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 3742 Invalid, 3895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3887 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 01:47:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2023-11-29 01:47:52,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1064. [2023-11-29 01:47:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 675 states have (on average 1.8888888888888888) internal successors, (1275), 1051 states have internal predecessors, (1275), 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) [2023-11-29 01:47:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1322 transitions. [2023-11-29 01:47:52,646 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1322 transitions. Word has length 110 [2023-11-29 01:47:52,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:47:52,646 INFO L495 AbstractCegarLoop]: Abstraction has 1064 states and 1322 transitions. [2023-11-29 01:47:52,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:47:52,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1322 transitions. [2023-11-29 01:47:52,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:47:52,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:47:52,648 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:47:52,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 01:47:52,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-11-29 01:47:53,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:47:53,051 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:47:53,051 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:47:53,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1204040714, now seen corresponding path program 1 times [2023-11-29 01:47:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:47:53,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324266372] [2023-11-29 01:47:53,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:53,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:47:53,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:47:53,053 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:47:53,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 01:47:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:47:53,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 01:47:53,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:47:53,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:47:54,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:47:54,050 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:47:54,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:47:54,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:47:54,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:47:54,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:47:54,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:47:54,837 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:54,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:47:54,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:47:54,947 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:47:54,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:47:54,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:47:54,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:47:54,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 [2023-11-29 01:47:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:47:55,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:47:55,147 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:47:55,184 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 01:47:56,581 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5076))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5075) .cse0 v_ArrVal_4983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5075 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5076 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5075) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5076) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4983) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 01:47:56,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:47:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324266372] [2023-11-29 01:47:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324266372] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:47:56,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [249282494] [2023-11-29 01:47:56,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:47:56,593 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:47:56,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:47:56,594 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:47:56,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 01:49:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:49:38,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 01:49:38,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:49:38,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:49:39,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:49:39,157 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:49:39,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 [2023-11-29 01:49:39,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:49:39,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:49:39,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:49:39,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:49:40,058 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:49:40,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:49:40,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:49:40,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:49:40,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:49:40,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:49:40,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:49:40,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:49:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:49:40,273 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:49:40,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 01:49:40,355 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 01:49:41,757 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5639) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5638) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5638 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5546 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5638))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5639) .cse2 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5546) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:49:41,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [249282494] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:49:41,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:49:41,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:49:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426702202] [2023-11-29 01:49:41,775 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:49:41,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:49:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:49:41,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:49:41,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 01:49:41,777 INFO L87 Difference]: Start difference. First operand 1064 states and 1322 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:49:51,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:49:51,096 INFO L93 Difference]: Finished difference Result 1479 states and 1861 transitions. [2023-11-29 01:49:51,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:49:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 01:49:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:49:51,101 INFO L225 Difference]: With dead ends: 1479 [2023-11-29 01:49:51,101 INFO L226 Difference]: Without dead ends: 1479 [2023-11-29 01:49:51,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 01:49:51,101 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 1755 mSDsluCounter, 1615 mSDsCounter, 0 mSdLazyCounter, 3786 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 3805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:49:51,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 2074 Invalid, 3805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3786 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2023-11-29 01:49:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2023-11-29 01:49:51,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1063. [2023-11-29 01:49:51,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1063 states, 675 states have (on average 1.8874074074074074) internal successors, (1274), 1050 states have internal predecessors, (1274), 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) [2023-11-29 01:49:51,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 1321 transitions. [2023-11-29 01:49:51,116 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 1321 transitions. Word has length 110 [2023-11-29 01:49:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:49:51,117 INFO L495 AbstractCegarLoop]: Abstraction has 1063 states and 1321 transitions. [2023-11-29 01:49:51,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:49:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1321 transitions. [2023-11-29 01:49:51,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:49:51,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:49:51,117 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:49:51,152 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 01:49:51,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-11-29 01:49:51,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:49:51,518 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:49:51,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:49:51,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1735561452, now seen corresponding path program 1 times [2023-11-29 01:49:51,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:49:51,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [716573517] [2023-11-29 01:49:51,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:49:51,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:49:51,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:49:51,520 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:49:51,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 01:49:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:49:52,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:49:52,410 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:49:52,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:49:52,556 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:49:52,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:49:52,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:49:52,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:49:53,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:49:53,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:49:53,726 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:49:53,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 44 treesize of output 43 [2023-11-29 01:49:53,814 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:49:53,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:49:53,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:49:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:49:53,870 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:49:53,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6079) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:49:53,944 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6079 (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$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6079) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:49:53,957 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6078))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:49:53,976 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6078))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:49:54,373 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6078 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6125))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6078)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:49:54,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:49:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [716573517] [2023-11-29 01:49:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [716573517] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:49:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007357363] [2023-11-29 01:49:54,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:49:54,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:49:54,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:49:54,378 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:49:54,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 01:50:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:50:21,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 01:50:22,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:50:22,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:50:22,327 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:50:22,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:50:22,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:50:22,579 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 20 treesize of output 12 [2023-11-29 01:50:23,411 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:50:23,411 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 36 treesize of output 35 [2023-11-29 01:50:23,568 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:50:23,568 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 36 treesize of output 35 [2023-11-29 01:50:23,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:50:23,668 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 36 treesize of output 35 [2023-11-29 01:50:23,686 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 27 treesize of output 15 [2023-11-29 01:50:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:50:23,695 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:50:23,711 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6565) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:50:27,794 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (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$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6564))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:50:27,808 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6564))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:50:28,218 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6611 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6611))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6564)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:50:28,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2007357363] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:50:28,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:50:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:50:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294612242] [2023-11-29 01:50:28,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:50:28,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:50:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:50:28,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:50:28,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=303, Unknown=10, NotChecked=396, Total=812 [2023-11-29 01:50:28,223 INFO L87 Difference]: Start difference. First operand 1063 states and 1321 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:50:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:50:35,462 INFO L93 Difference]: Finished difference Result 1478 states and 1860 transitions. [2023-11-29 01:50:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:50:35,464 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 01:50:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:50:35,467 INFO L225 Difference]: With dead ends: 1478 [2023-11-29 01:50:35,467 INFO L226 Difference]: Without dead ends: 1478 [2023-11-29 01:50:35,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=113, Invalid=333, Unknown=10, NotChecked=414, Total=870 [2023-11-29 01:50:35,468 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 1083 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 3001 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1088 SdHoareTripleChecker+Valid, 2870 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 3001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:50:35,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1088 Valid, 2870 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 3001 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2023-11-29 01:50:35,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2023-11-29 01:50:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1062. [2023-11-29 01:50:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 675 states have (on average 1.885925925925926) internal successors, (1273), 1049 states have internal predecessors, (1273), 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) [2023-11-29 01:50:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1320 transitions. [2023-11-29 01:50:35,484 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1320 transitions. Word has length 112 [2023-11-29 01:50:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:50:35,484 INFO L495 AbstractCegarLoop]: Abstraction has 1062 states and 1320 transitions. [2023-11-29 01:50:35,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:50:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1320 transitions. [2023-11-29 01:50:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:50:35,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:50:35,486 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:50:35,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 01:50:35,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 01:50:35,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:50:35,891 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:50:35,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:50:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1735561451, now seen corresponding path program 1 times [2023-11-29 01:50:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:50:35,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547237825] [2023-11-29 01:50:35,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:50:35,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:50:35,893 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:50:35,893 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:50:35,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 01:50:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:50:36,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 01:50:36,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:50:36,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:50:37,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:50:37,064 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:50:37,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:50:37,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:50:37,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:50:37,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:50:37,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:50:37,848 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:50:37,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:50:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:50:37,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:50:37,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:50:37,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:50:38,053 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:50:38,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 62 treesize of output 57 [2023-11-29 01:50:38,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:50:38,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:50:38,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:50:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:50:38,109 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:50:38,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:50:38,292 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-11-29 01:50:38,403 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7096))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7097) .cse0 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7097) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 01:50:38,490 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7096))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7097) .cse1 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7097) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 01:50:39,842 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7190))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7191) .cse1 v_ArrVal_7097) (select (select (store .cse2 .cse1 v_ArrVal_7096) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7099))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7096 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7190 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7190))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7096))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7191) .cse4 v_ArrVal_7097) .cse5 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:50:39,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:50:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547237825] [2023-11-29 01:50:39,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547237825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:50:39,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [747649251] [2023-11-29 01:50:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:50:39,858 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:50:39,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:50:39,858 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:50:39,859 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 01:51:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:07,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:51:07,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:51:07,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:51:08,163 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:51:08,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:51:08,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:51:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:51:08,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:51:08,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:51:08,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:51:09,042 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:51:09,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:51:09,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:51:09,224 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:51:09,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:51:09,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:51:09,358 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:51:09,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:51:09,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:51:09,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:51:09,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:51:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:51:09,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:51:09,443 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 01:51:09,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 01:51:09,558 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7677) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7676))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7677) .cse2 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:51:09,629 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7676))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7677) .cse1 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7677) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 01:51:11,570 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7770) .cse1 v_ArrVal_7677) (select (select (store .cse2 .cse1 v_ArrVal_7676) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7678))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7770 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7676 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7771))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7676))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7770) .cse4 v_ArrVal_7677) .cse5 v_ArrVal_7678) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:51:11,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [747649251] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:51:11,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:51:11,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:51:11,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280839362] [2023-11-29 01:51:11,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:51:11,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:51:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:51:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:51:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 01:51:11,591 INFO L87 Difference]: Start difference. First operand 1062 states and 1320 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:51:34,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:51:34,220 INFO L93 Difference]: Finished difference Result 1477 states and 1859 transitions. [2023-11-29 01:51:34,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:51:34,222 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 01:51:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:51:34,225 INFO L225 Difference]: With dead ends: 1477 [2023-11-29 01:51:34,225 INFO L226 Difference]: Without dead ends: 1477 [2023-11-29 01:51:34,225 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 01:51:34,225 INFO L413 NwaCegarLoop]: 459 mSDtfsCounter, 1744 mSDsluCounter, 2922 mSDsCounter, 0 mSdLazyCounter, 6858 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 6875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:51:34,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 3381 Invalid, 6875 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [17 Valid, 6858 Invalid, 0 Unknown, 0 Unchecked, 22.0s Time] [2023-11-29 01:51:34,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2023-11-29 01:51:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1061. [2023-11-29 01:51:34,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 675 states have (on average 1.8844444444444444) internal successors, (1272), 1048 states have internal predecessors, (1272), 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) [2023-11-29 01:51:34,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1319 transitions. [2023-11-29 01:51:34,240 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1319 transitions. Word has length 112 [2023-11-29 01:51:34,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:51:34,240 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1319 transitions. [2023-11-29 01:51:34,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:51:34,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1319 transitions. [2023-11-29 01:51:34,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:51:34,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:51:34,242 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:51:34,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 01:51:34,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 01:51:34,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:51:34,643 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:51:34,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:51:34,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1425887027, now seen corresponding path program 1 times [2023-11-29 01:51:34,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:51:34,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1599979223] [2023-11-29 01:51:34,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:34,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:51:34,644 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:51:34,645 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:51:34,646 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 01:51:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:51:35,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:51:35,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:51:35,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:51:35,943 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:51:35,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:51:35,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:51:36,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:51:37,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:51:37,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:51:37,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:51:37,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:51:37,715 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:51:37,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:51:37,856 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:51:37,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:51:37,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:51:37,941 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:51:37,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:51:38,034 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8227) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-11-29 01:51:38,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:51:38,071 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8226))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:51:38,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:51:38,114 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8225))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:51:38,138 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8225 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8225))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:51:38,606 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8225 (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$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8273))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8225)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:51:38,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:51:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1599979223] [2023-11-29 01:51:38,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1599979223] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:51:38,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [569874228] [2023-11-29 01:51:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:51:38,612 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:51:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:51:38,613 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:51:38,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 01:52:10,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:52:10,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:52:10,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:52:10,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:52:10,726 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:52:10,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:52:10,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:52:11,077 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 20 treesize of output 12 [2023-11-29 01:52:12,244 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:52:12,245 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 36 treesize of output 35 [2023-11-29 01:52:12,492 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:52:12,492 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 36 treesize of output 35 [2023-11-29 01:52:12,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:52:12,668 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 36 treesize of output 35 [2023-11-29 01:52:12,852 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:52:12,853 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 36 treesize of output 35 [2023-11-29 01:52:12,878 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 27 treesize of output 15 [2023-11-29 01:52:12,895 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:52:12,895 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:52:12,922 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8729) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 01:52:17,041 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8728))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:52:17,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:52:17,085 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8727))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:52:17,110 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8727))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:52:17,665 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8775 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8775))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8727)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8728)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:52:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [569874228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:52:17,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:52:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:52:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979546617] [2023-11-29 01:52:17,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:52:17,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:52:17,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:52:17,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:52:17,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=372, Unknown=16, NotChecked=676, Total=1190 [2023-11-29 01:52:17,673 INFO L87 Difference]: Start difference. First operand 1061 states and 1319 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:52:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:52:27,417 INFO L93 Difference]: Finished difference Result 1476 states and 1858 transitions. [2023-11-29 01:52:27,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:52:27,419 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 01:52:27,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:52:27,421 INFO L225 Difference]: With dead ends: 1476 [2023-11-29 01:52:27,421 INFO L226 Difference]: Without dead ends: 1476 [2023-11-29 01:52:27,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=136, Invalid=406, Unknown=16, NotChecked=702, Total=1260 [2023-11-29 01:52:27,422 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 1720 mSDsluCounter, 1969 mSDsCounter, 0 mSdLazyCounter, 2574 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:52:27,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1725 Valid, 2427 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2574 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 01:52:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2023-11-29 01:52:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1060. [2023-11-29 01:52:27,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 675 states have (on average 1.882962962962963) internal successors, (1271), 1047 states have internal predecessors, (1271), 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) [2023-11-29 01:52:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1318 transitions. [2023-11-29 01:52:27,434 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1318 transitions. Word has length 114 [2023-11-29 01:52:27,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:52:27,434 INFO L495 AbstractCegarLoop]: Abstraction has 1060 states and 1318 transitions. [2023-11-29 01:52:27,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:52:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1318 transitions. [2023-11-29 01:52:27,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 01:52:27,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:52:27,435 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:52:27,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 01:52:27,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 01:52:27,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:52:27,836 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:52:27,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:52:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1425887026, now seen corresponding path program 1 times [2023-11-29 01:52:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:52:27,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498651104] [2023-11-29 01:52:27,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:52:27,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:52:27,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:52:27,838 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:52:27,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 01:52:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:52:28,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 01:52:28,973 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:52:28,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:52:29,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:52:29,225 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:52:29,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:52:29,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:52:29,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:52:29,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:52:29,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:52:30,513 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:52:30,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:52:30,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:52:30,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:52:30,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:52:30,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:52:30,836 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:52:30,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:52:30,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:52:30,991 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:52:30,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:52:31,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:52:31,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:52:31,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:52:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:52:31,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:52:31,314 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:52:31,358 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:52:31,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9278))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9277) .cse0 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9277) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 01:52:31,632 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9277) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9278))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9277) .cse3 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:52:32,533 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9276))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9278))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9275) .cse0 v_ArrVal_9277) .cse1 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9276))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9275) .cse6 v_ArrVal_9277) (select (select (store .cse7 .cse6 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9280))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:52:34,397 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9276))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9275) .cse2 v_ArrVal_9277) (select (select (store .cse3 .cse2 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9280))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9276))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9278))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9275) .cse5 v_ArrVal_9277) .cse6 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:52:40,923 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9372))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9276))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9371) .cse1 v_ArrVal_9275) .cse2 v_ArrVal_9277) (select (select (store .cse3 .cse2 v_ArrVal_9278) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9280))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9276 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9275 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9372))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9276))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9278))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9371) .cse6 v_ArrVal_9275) .cse7 v_ArrVal_9277) .cse8 v_ArrVal_9280) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:52:40,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:52:40,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498651104] [2023-11-29 01:52:40,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498651104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:52:40,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [675163281] [2023-11-29 01:52:40,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:52:40,965 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:52:40,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:52:40,966 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:52:40,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 01:53:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:53:15,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 01:53:15,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:53:16,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:53:19,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 5 [2023-11-29 01:53:19,239 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:53:19,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:53:19,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:53:19,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:53:21,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:53:21,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:53:27,000 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:53:27,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:53:27,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:53:28,377 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:53:28,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:53:28,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:53:29,343 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:53:29,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:53:29,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:53:30,323 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:53:30,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:53:30,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:53:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:53:30,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:53:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:53:30,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:53:30,800 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 01:53:30,934 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:53:31,073 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9875) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9874))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9875) .cse2 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:53:31,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9875) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9874))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9875) .cse3 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:53:31,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9873))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9874))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9872) .cse0 v_ArrVal_9875) .cse1 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9873))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9872) .cse6 v_ArrVal_9875) (select (select (store .cse7 .cse6 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9877))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:53:31,555 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9873))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9874))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9872) .cse1 v_ArrVal_9875) .cse2 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9873))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9872) .cse7 v_ArrVal_9875) (select (select (store .cse8 .cse7 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9877))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 01:53:40,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9968))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9873))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9874))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9969) .cse0 v_ArrVal_9872) .cse1 v_ArrVal_9875) .cse2 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9872 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9968))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9873))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9969) .cse8 v_ArrVal_9872) .cse9 v_ArrVal_9875) (select (select (store .cse10 .cse9 v_ArrVal_9874) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9877))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 01:53:40,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [675163281] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:53:40,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:53:40,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:53:40,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247553342] [2023-11-29 01:53:40,400 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:53:40,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:53:40,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:53:40,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:53:40,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 01:53:40,402 INFO L87 Difference]: Start difference. First operand 1060 states and 1318 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:55:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:55:45,944 INFO L93 Difference]: Finished difference Result 1475 states and 1857 transitions. [2023-11-29 01:55:45,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:55:45,947 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 01:55:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:55:45,949 INFO L225 Difference]: With dead ends: 1475 [2023-11-29 01:55:45,949 INFO L226 Difference]: Without dead ends: 1475 [2023-11-29 01:55:45,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 01:55:45,950 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 1740 mSDsluCounter, 3260 mSDsCounter, 0 mSdLazyCounter, 7355 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 119.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1745 SdHoareTripleChecker+Valid, 3718 SdHoareTripleChecker+Invalid, 7374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 7355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 122.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:55:45,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1745 Valid, 3718 Invalid, 7374 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 7355 Invalid, 0 Unknown, 0 Unchecked, 122.9s Time] [2023-11-29 01:55:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2023-11-29 01:55:45,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1059. [2023-11-29 01:55:45,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 675 states have (on average 1.8814814814814815) internal successors, (1270), 1046 states have internal predecessors, (1270), 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) [2023-11-29 01:55:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1317 transitions. [2023-11-29 01:55:45,962 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1317 transitions. Word has length 114 [2023-11-29 01:55:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:55:45,962 INFO L495 AbstractCegarLoop]: Abstraction has 1059 states and 1317 transitions. [2023-11-29 01:55:45,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:55:45,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1317 transitions. [2023-11-29 01:55:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 01:55:45,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:55:45,963 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:55:45,988 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 01:55:46,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-11-29 01:55:46,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:55:46,364 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 01:55:46,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:55:46,364 INFO L85 PathProgramCache]: Analyzing trace with hash -181470508, now seen corresponding path program 1 times [2023-11-29 01:55:46,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:55:46,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [924600460] [2023-11-29 01:55:46,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:55:46,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:55:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:55:46,366 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:55:46,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 01:55:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:55:47,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:55:47,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:55:47,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:55:49,770 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:55:49,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:55:50,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:55:50,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:55:58,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:55:58,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:55:59,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:55:59,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:56:00,483 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:56:00,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 [2023-11-29 01:56:01,260 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:56:01,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:56:02,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:56:02,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:56:02,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:56:02,585 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 01:56:02,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 01:56:03,084 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:56:03,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:56:03,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10443) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:56:04,047 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10443) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 01:56:04,131 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10442))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:56:04,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:56:04,313 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10441))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:56:04,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10441))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:56:04,499 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10440))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10441)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:56:07,613 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10490 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10490))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10440)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10441)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:56:07,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:56:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [924600460] [2023-11-29 01:56:07,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [924600460] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:56:07,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [355128905] [2023-11-29 01:56:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:56:07,636 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:56:07,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:56:07,637 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:56:07,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b417d6a3-3168-49fb-bf66-ee8c5ff8478c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 01:56:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:56:12,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 01:56:12,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:56:12,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 7 [2023-11-29 01:56:16,775 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:56:16,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:56:17,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:56:19,062 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 20 treesize of output 12 [2023-11-29 01:56:28,862 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:56:28,862 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 36 treesize of output 35 [2023-11-29 01:56:30,538 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:56:30,538 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 36 treesize of output 35 [2023-11-29 01:56:31,624 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:56:31,624 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 36 treesize of output 35 [2023-11-29 01:56:32,689 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:56:32,689 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 36 treesize of output 35 [2023-11-29 01:56:33,854 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:56:33,855 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 36 treesize of output 35 [2023-11-29 01:56:33,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 27 treesize of output 15 [2023-11-29 01:56:34,572 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 01:56:34,573 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 [2023-11-29 01:56:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:56:34,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:56:35,710 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10964) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 01:56:35,792 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10964) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:56:35,876 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10963))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:56:35,961 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:56:36,050 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10962))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:56:36,142 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10962))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:56:36,250 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10961))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10962)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:56:36,353 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10961 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10962 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10961))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10962)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:56:39,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [355128905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:56:39,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:56:39,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 01:56:39,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270408169] [2023-11-29 01:56:39,164 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:56:39,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:56:39,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:56:39,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:56:39,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=586, Unknown=21, NotChecked=1040, Total=1806 [2023-11-29 01:56:39,166 INFO L87 Difference]: Start difference. First operand 1059 states and 1317 transitions. Second operand has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)