./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:17:29,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:17:29,323 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:17:29,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:17:29,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:17:29,357 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:17:29,358 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:17:29,359 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:17:29,360 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:17:29,360 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:17:29,361 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:17:29,361 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:17:29,362 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:17:29,363 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:17:29,364 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:17:29,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:17:29,365 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:17:29,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:17:29,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:17:29,367 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:17:29,367 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:17:29,368 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:17:29,369 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:17:29,369 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:17:29,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:17:29,370 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:17:29,371 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:17:29,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:17:29,372 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:17:29,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:17:29,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:17:29,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:17:29,374 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:17:29,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:17:29,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:17:29,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:17:29,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:17:29,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:17:29,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:17:29,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:17:29,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:17:29,377 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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2023-11-29 04:17:29,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:17:29,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:17:29,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:17:29,694 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:17:29,694 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:17:29,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2023-11-29 04:17:32,765 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:17:33,091 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:17:33,092 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2023-11-29 04:17:33,112 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data/0e69979d3/8c59a8f271c84e15886a9a01b880143e/FLAG79c0f5958 [2023-11-29 04:17:33,124 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data/0e69979d3/8c59a8f271c84e15886a9a01b880143e [2023-11-29 04:17:33,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:17:33,128 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:17:33,130 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:17:33,130 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:17:33,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:17:33,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:17:33" (1/1) ... [2023-11-29 04:17:33,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f46e951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:33, skipping insertion in model container [2023-11-29 04:17:33,136 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:17:33" (1/1) ... [2023-11-29 04:17:33,195 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:17:33,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:17:33,712 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 04:17:33,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4eb83c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:33, skipping insertion in model container [2023-11-29 04:17:33,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:17:33,713 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:17:33,716 INFO L158 Benchmark]: Toolchain (without parser) took 586.08ms. Allocated memory is still 153.1MB. Free memory was 110.5MB in the beginning and 90.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:17:33,716 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 153.1MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:17:33,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.37ms. Allocated memory is still 153.1MB. Free memory was 110.5MB in the beginning and 90.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:17:33,720 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 153.1MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.37ms. Allocated memory is still 153.1MB. Free memory was 110.5MB in the beginning and 90.1MB in the end (delta: 20.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:17:35,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:17:35,900 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:17:35,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:17:35,908 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:17:35,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:17:35,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:17:35,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:17:35,939 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:17:35,940 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:17:35,941 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:17:35,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:17:35,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:17:35,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:17:35,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:17:35,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:17:35,945 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:17:35,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:17:35,946 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:17:35,946 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:17:35,947 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:17:35,947 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:17:35,948 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:17:35,948 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:17:35,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:17:35,949 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:17:35,950 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:17:35,950 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:17:35,951 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:17:35,951 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:17:35,952 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:17:35,952 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:17:35,952 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:17:35,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:17:35,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:17:35,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:17:35,954 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:17:35,954 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:17:35,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:17:35,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:17:35,955 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:17:35,955 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:17:35,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:17:35,955 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:17:35,956 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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/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 -> 9e43379b3f2624d77eec1084820c7c07499f5ec4432514ab066d4f5cf96eeebc [2023-11-29 04:17:36,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:17:36,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:17:36,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:17:36,322 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:17:36,323 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:17:36,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2023-11-29 04:17:39,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:17:39,781 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:17:39,782 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test7-2.i [2023-11-29 04:17:39,805 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data/50f24d602/5e942e9f16e94ad8b2b1d3de86601bc9/FLAGdaef29bf2 [2023-11-29 04:17:39,824 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/data/50f24d602/5e942e9f16e94ad8b2b1d3de86601bc9 [2023-11-29 04:17:39,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:17:39,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:17:39,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:17:39,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:17:39,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:17:39,838 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:17:39" (1/1) ... [2023-11-29 04:17:39,840 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@731a6c91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:39, skipping insertion in model container [2023-11-29 04:17:39,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:17:39" (1/1) ... [2023-11-29 04:17:39,934 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:17:40,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:17:40,515 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:17:40,531 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:17:40,617 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:17:40,622 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:17:40,729 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:17:40,763 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:17:40,770 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:17:40,770 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40 WrapperNode [2023-11-29 04:17:40,770 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:17:40,771 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:17:40,771 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:17:40,772 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:17:40,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:40,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:40,900 INFO L138 Inliner]: procedures = 179, calls = 331, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1184 [2023-11-29 04:17:40,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:17:40,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:17:40,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:17:40,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:17:40,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:40,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:40,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,076 INFO L175 MemorySlicer]: Split 306 memory accesses to 4 slices as follows [2, 5, 34, 265]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 1, 4, 58]. [2023-11-29 04:17:41,077 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,077 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,126 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,148 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:17:41,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:17:41,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:17:41,172 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:17:41,173 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (1/1) ... [2023-11-29 04:17:41,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:17:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:17:41,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:17:41,210 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:17:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 04:17:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 04:17:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:17:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:17:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:17:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:17:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:17:41,248 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:17:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:17:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:17:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 04:17:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 04:17:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 04:17:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 04:17:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 04:17:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 04:17:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 04:17:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 04:17:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:17:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:17:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:17:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:17:41,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:17:41,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:17:41,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:17:41,252 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 04:17:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:17:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:17:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:17:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:17:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:17:41,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:17:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:17:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:17:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:17:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:17:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:17:41,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:17:41,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:17:41,255 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:17:41,255 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:17:41,550 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:17:41,553 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:17:41,583 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:17:41,624 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:17:41,650 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:17:41,679 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:17:47,325 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:17:47,582 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:17:47,583 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-11-29 04:17:47,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:17:47 BoogieIcfgContainer [2023-11-29 04:17:47,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:17:47,589 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:17:47,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:17:47,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:17:47,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:17:39" (1/3) ... [2023-11-29 04:17:47,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630ca2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:17:47, skipping insertion in model container [2023-11-29 04:17:47,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:17:40" (2/3) ... [2023-11-29 04:17:47,595 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@630ca2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:17:47, skipping insertion in model container [2023-11-29 04:17:47,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:17:47" (3/3) ... [2023-11-29 04:17:47,597 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test7-2.i [2023-11-29 04:17:47,622 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:17:47,622 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 634 error locations. [2023-11-29 04:17:47,707 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:17:47,715 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;@15031637, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:17:47,716 INFO L358 AbstractCegarLoop]: Starting to check reachability of 634 error locations. [2023-11-29 04:17:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 1139 states, 500 states have (on average 2.548) internal successors, (1274), 1132 states have internal predecessors, (1274), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:17:47,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:17:47,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:47,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:17:47,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:17:47,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:47,753 INFO L85 PathProgramCache]: Analyzing trace with hash 63103, now seen corresponding path program 1 times [2023-11-29 04:17:47,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:17:47,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073858851] [2023-11-29 04:17:47,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:47,768 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 04:17:47,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:17:47,772 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:47,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:48,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:17:48,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:17:48,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:17:48,140 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 04:17:48,140 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:17:48,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:17:48,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073858851] [2023-11-29 04:17:48,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073858851] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:48,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:48,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:17:48,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728608400] [2023-11-29 04:17:48,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:48,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:17:48,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:17:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:17:48,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:17:48,191 INFO L87 Difference]: Start difference. First operand has 1139 states, 500 states have (on average 2.548) internal successors, (1274), 1132 states have internal predecessors, (1274), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) 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 04:17:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:51,018 INFO L93 Difference]: Finished difference Result 1297 states and 1372 transitions. [2023-11-29 04:17:51,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:17:51,021 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 04:17:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:51,045 INFO L225 Difference]: With dead ends: 1297 [2023-11-29 04:17:51,045 INFO L226 Difference]: Without dead ends: 1296 [2023-11-29 04:17:51,047 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 04:17:51,051 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 1058 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1061 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:51,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1061 Valid, 752 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 04:17:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-11-29 04:17:51,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1123. [2023-11-29 04:17:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 502 states have (on average 2.354581673306773) internal successors, (1182), 1117 states have internal predecessors, (1182), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:17:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1190 transitions. [2023-11-29 04:17:51,158 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1190 transitions. Word has length 2 [2023-11-29 04:17:51,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:51,159 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1190 transitions. [2023-11-29 04:17:51,159 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 04:17:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1190 transitions. [2023-11-29 04:17:51,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:17:51,159 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:51,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:17:51,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:51,364 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:17:51,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 63104, now seen corresponding path program 1 times [2023-11-29 04:17:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:17:51,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285599088] [2023-11-29 04:17:51,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:51,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 04:17:51,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:17:51,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:51,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:51,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:17:51,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:17:51,506 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 04:17:51,519 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 04:17:51,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:17:51,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:17:51,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285599088] [2023-11-29 04:17:51,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1285599088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:51,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:51,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:17:51,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532244898] [2023-11-29 04:17:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:51,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:17:51,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:17:51,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:17:51,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:17:51,524 INFO L87 Difference]: Start difference. First operand 1123 states and 1190 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 04:17:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:17:56,364 INFO L93 Difference]: Finished difference Result 1662 states and 1771 transitions. [2023-11-29 04:17:56,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:17:56,365 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 04:17:56,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:17:56,373 INFO L225 Difference]: With dead ends: 1662 [2023-11-29 04:17:56,373 INFO L226 Difference]: Without dead ends: 1662 [2023-11-29 04:17:56,373 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 04:17:56,374 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 579 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:17:56,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1402 Invalid, 961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-29 04:17:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2023-11-29 04:17:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1292. [2023-11-29 04:17:56,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 672 states have (on average 2.325892857142857) internal successors, (1563), 1286 states have internal predecessors, (1563), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:17:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1571 transitions. [2023-11-29 04:17:56,413 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1571 transitions. Word has length 2 [2023-11-29 04:17:56,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:17:56,413 INFO L495 AbstractCegarLoop]: Abstraction has 1292 states and 1571 transitions. [2023-11-29 04:17:56,413 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 04:17:56,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1571 transitions. [2023-11-29 04:17:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:17:56,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:17:56,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 04:17:56,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:56,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:56,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:17:56,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:17:56,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1851850551, now seen corresponding path program 1 times [2023-11-29 04:17:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:17:56,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1043665813] [2023-11-29 04:17:56,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:17:56,617 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 04:17:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:17:56,619 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:56,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:17:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:17:56,799 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:17:56,803 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:17:56,816 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 04:17:56,823 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 04:17:56,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:17:56,901 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 04:17:56,921 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:17:56,921 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 04:17:56,948 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 04:17:56,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:17:56,949 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:17:56,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1043665813] [2023-11-29 04:17:56,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1043665813] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:17:56,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:17:56,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:17:56,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539308300] [2023-11-29 04:17:56,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:17:56,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:17:56,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:17:56,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:17:56,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:17:56,952 INFO L87 Difference]: Start difference. First operand 1292 states and 1571 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 04:18:01,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:01,235 INFO L93 Difference]: Finished difference Result 1459 states and 1749 transitions. [2023-11-29 04:18:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:01,236 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 04:18:01,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:01,243 INFO L225 Difference]: With dead ends: 1459 [2023-11-29 04:18:01,243 INFO L226 Difference]: Without dead ends: 1459 [2023-11-29 04:18:01,243 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 04:18:01,245 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 1331 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1119 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:01,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1334 Valid, 377 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1119 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 04:18:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2023-11-29 04:18:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1112. [2023-11-29 04:18:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 502 states have (on average 2.3306772908366535) internal successors, (1170), 1106 states have internal predecessors, (1170), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:01,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1178 transitions. [2023-11-29 04:18:01,273 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1178 transitions. Word has length 6 [2023-11-29 04:18:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:01,273 INFO L495 AbstractCegarLoop]: Abstraction has 1112 states and 1178 transitions. [2023-11-29 04:18:01,274 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 04:18:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1178 transitions. [2023-11-29 04:18:01,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:18:01,275 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:01,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:01,278 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:01,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:01,479 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:01,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1572792223, now seen corresponding path program 1 times [2023-11-29 04:18:01,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:01,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1743406167] [2023-11-29 04:18:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:01,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:18:01,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:01,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:01,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:01,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:01,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:18:01,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:01,629 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 04:18:01,643 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 04:18:01,643 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:01,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:01,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1743406167] [2023-11-29 04:18:01,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1743406167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:01,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:01,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:18:01,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266228608] [2023-11-29 04:18:01,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:01,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:01,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:01,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:01,646 INFO L87 Difference]: Start difference. First operand 1112 states and 1178 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 04:18:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:04,426 INFO L93 Difference]: Finished difference Result 1408 states and 1504 transitions. [2023-11-29 04:18:04,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:04,429 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 04:18:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:04,436 INFO L225 Difference]: With dead ends: 1408 [2023-11-29 04:18:04,436 INFO L226 Difference]: Without dead ends: 1408 [2023-11-29 04:18:04,436 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 04:18:04,438 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 881 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 873 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:04,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1233 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 873 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 04:18:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-29 04:18:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1065. [2023-11-29 04:18:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 502 states have (on average 2.237051792828685) internal successors, (1123), 1059 states have internal predecessors, (1123), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1131 transitions. [2023-11-29 04:18:04,465 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1131 transitions. Word has length 7 [2023-11-29 04:18:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:04,466 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1131 transitions. [2023-11-29 04:18:04,466 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 04:18:04,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1131 transitions. [2023-11-29 04:18:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:18:04,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:04,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:04,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:04,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:04,678 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:04,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:04,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1572792222, now seen corresponding path program 1 times [2023-11-29 04:18:04,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:04,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798896654] [2023-11-29 04:18:04,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:04,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:18:04,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:04,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:04,681 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:04,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:18:04,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:04,836 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 04:18:04,864 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 04:18:04,864 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:04,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798896654] [2023-11-29 04:18:04,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798896654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:04,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:04,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:18:04,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621144615] [2023-11-29 04:18:04,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:04,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:04,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:04,867 INFO L87 Difference]: Start difference. First operand 1065 states and 1131 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 04:18:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:09,085 INFO L93 Difference]: Finished difference Result 1478 states and 1577 transitions. [2023-11-29 04:18:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:09,086 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 04:18:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:09,093 INFO L225 Difference]: With dead ends: 1478 [2023-11-29 04:18:09,093 INFO L226 Difference]: Without dead ends: 1478 [2023-11-29 04:18:09,094 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 04:18:09,094 INFO L413 NwaCegarLoop]: 1108 mSDtfsCounter, 613 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:09,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1536 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 04:18:09,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2023-11-29 04:18:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1078. [2023-11-29 04:18:09,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 525 states have (on average 2.2285714285714286) internal successors, (1170), 1072 states have internal predecessors, (1170), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:09,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1178 transitions. [2023-11-29 04:18:09,127 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1178 transitions. Word has length 7 [2023-11-29 04:18:09,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:09,127 INFO L495 AbstractCegarLoop]: Abstraction has 1078 states and 1178 transitions. [2023-11-29 04:18:09,127 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 04:18:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1178 transitions. [2023-11-29 04:18:09,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:18:09,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:09,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:09,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:18:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:09,331 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:09,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash 774433652, now seen corresponding path program 1 times [2023-11-29 04:18:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:09,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836396415] [2023-11-29 04:18:09,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:09,333 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 04:18:09,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:09,334 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:09,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:09,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:09,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:18:09,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:09,593 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 04:18:09,593 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:09,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:09,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836396415] [2023-11-29 04:18:09,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836396415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:09,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:09,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:18:09,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155104154] [2023-11-29 04:18:09,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:09,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:09,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:09,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:09,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:09,596 INFO L87 Difference]: Start difference. First operand 1078 states and 1178 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:12,111 INFO L93 Difference]: Finished difference Result 1667 states and 1811 transitions. [2023-11-29 04:18:12,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:18:12,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 04:18:12,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:12,121 INFO L225 Difference]: With dead ends: 1667 [2023-11-29 04:18:12,121 INFO L226 Difference]: Without dead ends: 1667 [2023-11-29 04:18:12,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:18:12,122 INFO L413 NwaCegarLoop]: 1089 mSDtfsCounter, 689 mSDsluCounter, 1822 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 2911 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:12,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 2911 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 04:18:12,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2023-11-29 04:18:12,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1282. [2023-11-29 04:18:12,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 729 states have (on average 2.179698216735254) internal successors, (1589), 1276 states have internal predecessors, (1589), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1597 transitions. [2023-11-29 04:18:12,163 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1597 transitions. Word has length 12 [2023-11-29 04:18:12,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:12,163 INFO L495 AbstractCegarLoop]: Abstraction has 1282 states and 1597 transitions. [2023-11-29 04:18:12,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:12,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1597 transitions. [2023-11-29 04:18:12,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:18:12,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:12,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:12,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:12,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:12,365 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:12,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 188114419, now seen corresponding path program 1 times [2023-11-29 04:18:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845510959] [2023-11-29 04:18:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:12,366 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 04:18:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:12,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:12,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:12,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:18:12,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:12,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:12,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:12,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:12,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845510959] [2023-11-29 04:18:12,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845510959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:12,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:12,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:18:12,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029455042] [2023-11-29 04:18:12,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:12,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:12,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:12,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:12,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:12,521 INFO L87 Difference]: Start difference. First operand 1282 states and 1597 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:13,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:13,529 INFO L93 Difference]: Finished difference Result 1228 states and 1517 transitions. [2023-11-29 04:18:13,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:13,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 04:18:13,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:13,536 INFO L225 Difference]: With dead ends: 1228 [2023-11-29 04:18:13,536 INFO L226 Difference]: Without dead ends: 1228 [2023-11-29 04:18:13,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 04:18:13,537 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 70 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:13,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1837 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:18:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2023-11-29 04:18:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1228. [2023-11-29 04:18:13,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 699 states have (on average 2.1587982832618025) internal successors, (1509), 1222 states have internal predecessors, (1509), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:13,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1517 transitions. [2023-11-29 04:18:13,559 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1517 transitions. Word has length 12 [2023-11-29 04:18:13,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:13,559 INFO L495 AbstractCegarLoop]: Abstraction has 1228 states and 1517 transitions. [2023-11-29 04:18:13,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:13,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1517 transitions. [2023-11-29 04:18:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 04:18:13,560 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:13,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:13,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:13,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:13,761 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr364REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:13,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash 389355628, now seen corresponding path program 1 times [2023-11-29 04:18:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:13,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1476326057] [2023-11-29 04:18:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:13,763 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 04:18:13,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:13,764 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:13,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:13,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:18:13,896 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:13,912 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 04:18:13,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:13,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:13,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1476326057] [2023-11-29 04:18:13,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1476326057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:13,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:13,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:13,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055412190] [2023-11-29 04:18:13,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:13,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:13,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:13,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:13,915 INFO L87 Difference]: Start difference. First operand 1228 states and 1517 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 04:18:15,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:15,181 INFO L93 Difference]: Finished difference Result 1214 states and 1475 transitions. [2023-11-29 04:18:15,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:15,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2023-11-29 04:18:15,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:15,189 INFO L225 Difference]: With dead ends: 1214 [2023-11-29 04:18:15,189 INFO L226 Difference]: Without dead ends: 1214 [2023-11-29 04:18:15,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 04:18:15,189 INFO L413 NwaCegarLoop]: 912 mSDtfsCounter, 58 mSDsluCounter, 1800 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:15,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2712 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:18:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2023-11-29 04:18:15,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 1212. [2023-11-29 04:18:15,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 697 states have (on average 2.101865136298422) internal successors, (1465), 1206 states have internal predecessors, (1465), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1473 transitions. [2023-11-29 04:18:15,212 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1473 transitions. Word has length 14 [2023-11-29 04:18:15,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:15,212 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 1473 transitions. [2023-11-29 04:18:15,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 04:18:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1473 transitions. [2023-11-29 04:18:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:18:15,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:15,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:15,216 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:18:15,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:15,414 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr632ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:15,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:15,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1919746299, now seen corresponding path program 1 times [2023-11-29 04:18:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:15,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606027175] [2023-11-29 04:18:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:15,415 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 04:18:15,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:15,416 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:15,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:15,637 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:18:15,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:15,650 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:18:15,651 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:18:15,655 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 33 treesize of output 31 [2023-11-29 04:18:15,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:18:15,707 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 62 treesize of output 22 [2023-11-29 04:18:15,737 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 04:18:15,737 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:15,738 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606027175] [2023-11-29 04:18:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606027175] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885460946] [2023-11-29 04:18:15,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:15,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:15,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:15,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:15,740 INFO L87 Difference]: Start difference. First operand 1212 states and 1473 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 04:18:18,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:18,629 INFO L93 Difference]: Finished difference Result 2162 states and 2519 transitions. [2023-11-29 04:18:18,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:18,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 04:18:18,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:18,640 INFO L225 Difference]: With dead ends: 2162 [2023-11-29 04:18:18,640 INFO L226 Difference]: Without dead ends: 2162 [2023-11-29 04:18:18,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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 04:18:18,641 INFO L413 NwaCegarLoop]: 1104 mSDtfsCounter, 989 mSDsluCounter, 2021 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 3125 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:18,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 3125 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 04:18:18,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2023-11-29 04:18:18,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 1211. [2023-11-29 04:18:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 696 states have (on average 2.1020114942528734) internal successors, (1463), 1205 states have internal predecessors, (1463), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1471 transitions. [2023-11-29 04:18:18,668 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1471 transitions. Word has length 15 [2023-11-29 04:18:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:18,668 INFO L495 AbstractCegarLoop]: Abstraction has 1211 states and 1471 transitions. [2023-11-29 04:18:18,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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 04:18:18,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1471 transitions. [2023-11-29 04:18:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:18:18,669 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:18,669 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:18,672 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:18,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:18,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:18,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:18,870 INFO L85 PathProgramCache]: Analyzing trace with hash 259971672, now seen corresponding path program 1 times [2023-11-29 04:18:18,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:18,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989543037] [2023-11-29 04:18:18,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:18,871 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 04:18:18,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:18,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:18,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:19,042 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:18:19,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:19,051 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 04:18:19,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:19,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:19,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989543037] [2023-11-29 04:18:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989543037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:19,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:18:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689655829] [2023-11-29 04:18:19,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:19,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:19,054 INFO L87 Difference]: Start difference. First operand 1211 states and 1471 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 04:18:19,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:19,976 INFO L93 Difference]: Finished difference Result 1157 states and 1391 transitions. [2023-11-29 04:18:19,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:19,978 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 04:18:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:19,983 INFO L225 Difference]: With dead ends: 1157 [2023-11-29 04:18:19,983 INFO L226 Difference]: Without dead ends: 1157 [2023-11-29 04:18:19,983 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 04:18:19,984 INFO L413 NwaCegarLoop]: 885 mSDtfsCounter, 70 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:19,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1721 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:18:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2023-11-29 04:18:19,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1157. [2023-11-29 04:18:20,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 666 states have (on average 2.0765765765765765) internal successors, (1383), 1151 states have internal predecessors, (1383), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1391 transitions. [2023-11-29 04:18:20,003 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1391 transitions. Word has length 15 [2023-11-29 04:18:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:20,003 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1391 transitions. [2023-11-29 04:18:20,004 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 04:18:20,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1391 transitions. [2023-11-29 04:18:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:18:20,004 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:20,005 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 04:18:20,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:20,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:20,206 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:20,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:20,206 INFO L85 PathProgramCache]: Analyzing trace with hash 724671154, now seen corresponding path program 1 times [2023-11-29 04:18:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121132306] [2023-11-29 04:18:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:20,207 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 04:18:20,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:20,208 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:20,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:20,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:18:20,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:20,399 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 04:18:20,399 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:20,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:20,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121132306] [2023-11-29 04:18:20,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121132306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:20,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:20,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897849405] [2023-11-29 04:18:20,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:20,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:20,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:20,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:20,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:20,401 INFO L87 Difference]: Start difference. First operand 1157 states and 1391 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 04:18:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:21,647 INFO L93 Difference]: Finished difference Result 1143 states and 1349 transitions. [2023-11-29 04:18:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:21,649 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 04:18:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:21,654 INFO L225 Difference]: With dead ends: 1143 [2023-11-29 04:18:21,654 INFO L226 Difference]: Without dead ends: 1143 [2023-11-29 04:18:21,655 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 04:18:21,655 INFO L413 NwaCegarLoop]: 854 mSDtfsCounter, 58 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2538 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:21,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2538 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:18:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2023-11-29 04:18:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 1141. [2023-11-29 04:18:21,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 664 states have (on average 2.016566265060241) internal successors, (1339), 1135 states have internal predecessors, (1339), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1347 transitions. [2023-11-29 04:18:21,674 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1347 transitions. Word has length 17 [2023-11-29 04:18:21,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:21,675 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1347 transitions. [2023-11-29 04:18:21,675 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 04:18:21,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1347 transitions. [2023-11-29 04:18:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:18:21,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:21,676 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 04:18:21,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:21,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:21,881 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:21,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:21,881 INFO L85 PathProgramCache]: Analyzing trace with hash -858277088, now seen corresponding path program 1 times [2023-11-29 04:18:21,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:21,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455143355] [2023-11-29 04:18:21,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:21,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:18:21,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:21,883 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:21,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:22,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:18:22,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:22,103 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 04:18:22,172 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 04:18:22,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:22,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:22,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455143355] [2023-11-29 04:18:22,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455143355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:22,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:22,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:18:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948205996] [2023-11-29 04:18:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:22,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:22,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:22,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:22,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:22,174 INFO L87 Difference]: Start difference. First operand 1141 states and 1347 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 04:18:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:25,259 INFO L93 Difference]: Finished difference Result 1489 states and 1809 transitions. [2023-11-29 04:18:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:25,261 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 04:18:25,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:25,270 INFO L225 Difference]: With dead ends: 1489 [2023-11-29 04:18:25,270 INFO L226 Difference]: Without dead ends: 1489 [2023-11-29 04:18:25,270 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 04:18:25,271 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 746 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1247 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1220 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:25,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1220 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1247 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 04:18:25,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2023-11-29 04:18:25,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1137. [2023-11-29 04:18:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 664 states have (on average 2.0045180722891565) internal successors, (1331), 1131 states have internal predecessors, (1331), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:25,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1339 transitions. [2023-11-29 04:18:25,303 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1339 transitions. Word has length 31 [2023-11-29 04:18:25,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:25,304 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1339 transitions. [2023-11-29 04:18:25,304 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 04:18:25,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1339 transitions. [2023-11-29 04:18:25,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:18:25,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:25,305 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 04:18:25,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:25,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:25,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:25,506 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:25,506 INFO L85 PathProgramCache]: Analyzing trace with hash -858277087, now seen corresponding path program 1 times [2023-11-29 04:18:25,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:25,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065323179] [2023-11-29 04:18:25,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:25,507 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 04:18:25,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:25,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:25,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:25,690 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:18:25,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:25,703 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 04:18:25,872 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 04:18:25,872 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:25,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:25,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065323179] [2023-11-29 04:18:25,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065323179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:25,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:25,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:18:25,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337269158] [2023-11-29 04:18:25,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:25,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:25,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:25,874 INFO L87 Difference]: Start difference. First operand 1137 states and 1339 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 04:18:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:30,662 INFO L93 Difference]: Finished difference Result 1591 states and 1890 transitions. [2023-11-29 04:18:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:30,663 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 04:18:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:30,671 INFO L225 Difference]: With dead ends: 1591 [2023-11-29 04:18:30,671 INFO L226 Difference]: Without dead ends: 1591 [2023-11-29 04:18:30,671 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 04:18:30,672 INFO L413 NwaCegarLoop]: 1046 mSDtfsCounter, 480 mSDsluCounter, 1034 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:30,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2080 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 04:18:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2023-11-29 04:18:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1133. [2023-11-29 04:18:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 664 states have (on average 1.9924698795180722) internal successors, (1323), 1127 states have internal predecessors, (1323), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1331 transitions. [2023-11-29 04:18:30,690 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1331 transitions. Word has length 31 [2023-11-29 04:18:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:30,691 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1331 transitions. [2023-11-29 04:18:30,691 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 04:18:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1331 transitions. [2023-11-29 04:18:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 04:18:30,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:30,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:18:30,696 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:18:30,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:30,894 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:30,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:30,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1253253137, now seen corresponding path program 1 times [2023-11-29 04:18:30,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:30,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [180276128] [2023-11-29 04:18:30,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:30,895 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 04:18:30,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:30,896 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:30,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:31,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:18:31,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:31,161 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 04:18:31,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:31,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:31,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [180276128] [2023-11-29 04:18:31,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [180276128] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:31,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:31,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:31,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530212362] [2023-11-29 04:18:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:31,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:31,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:31,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:31,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:31,163 INFO L87 Difference]: Start difference. First operand 1133 states and 1331 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:32,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:32,387 INFO L93 Difference]: Finished difference Result 1121 states and 1311 transitions. [2023-11-29 04:18:32,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:32,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 04:18:32,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:32,393 INFO L225 Difference]: With dead ends: 1121 [2023-11-29 04:18:32,393 INFO L226 Difference]: Without dead ends: 1121 [2023-11-29 04:18:32,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:18:32,394 INFO L413 NwaCegarLoop]: 848 mSDtfsCounter, 23 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2524 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:32,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2524 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:18:32,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2023-11-29 04:18:32,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1121. [2023-11-29 04:18:32,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 652 states have (on average 1.9984662576687116) internal successors, (1303), 1115 states have internal predecessors, (1303), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:32,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1311 transitions. [2023-11-29 04:18:32,408 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1311 transitions. Word has length 50 [2023-11-29 04:18:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:32,408 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1311 transitions. [2023-11-29 04:18:32,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:32,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1311 transitions. [2023-11-29 04:18:32,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 04:18:32,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:32,410 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 04:18:32,416 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:32,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:32,611 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:32,611 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:32,611 INFO L85 PathProgramCache]: Analyzing trace with hash 486980144, now seen corresponding path program 1 times [2023-11-29 04:18:32,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:32,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323366591] [2023-11-29 04:18:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:32,612 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 04:18:32,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:32,613 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:32,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:32,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:18:32,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:32,989 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 04:18:32,996 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 04:18:33,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:33,597 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 04:18:33,612 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:18:33,613 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 04:18:33,623 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 04:18:33,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:33,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:33,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323366591] [2023-11-29 04:18:33,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323366591] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:33,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:33,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:18:33,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779424008] [2023-11-29 04:18:33,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:33,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:33,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:33,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:33,625 INFO L87 Difference]: Start difference. First operand 1121 states and 1311 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 04:18:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:37,497 INFO L93 Difference]: Finished difference Result 1435 states and 1743 transitions. [2023-11-29 04:18:37,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:37,499 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 04:18:37,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:37,506 INFO L225 Difference]: With dead ends: 1435 [2023-11-29 04:18:37,506 INFO L226 Difference]: Without dead ends: 1435 [2023-11-29 04:18:37,506 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 04:18:37,507 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 968 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 627 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 04:18:37,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2023-11-29 04:18:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 1060. [2023-11-29 04:18:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 629 states have (on average 1.9205087440381559) internal successors, (1208), 1054 states have internal predecessors, (1208), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:37,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1216 transitions. [2023-11-29 04:18:37,522 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1216 transitions. Word has length 54 [2023-11-29 04:18:37,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:37,523 INFO L495 AbstractCegarLoop]: Abstraction has 1060 states and 1216 transitions. [2023-11-29 04:18:37,523 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 04:18:37,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1216 transitions. [2023-11-29 04:18:37,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:18:37,524 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:37,524 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 04:18:37,530 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:37,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:37,725 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:37,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:37,725 INFO L85 PathProgramCache]: Analyzing trace with hash -950660076, now seen corresponding path program 1 times [2023-11-29 04:18:37,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:37,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041185304] [2023-11-29 04:18:37,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:37,726 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 04:18:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:37,727 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:37,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:38,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:18:38,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:38,018 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 04:18:38,038 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 04:18:38,064 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 04:18:38,076 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 04:18:38,076 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:38,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:38,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041185304] [2023-11-29 04:18:38,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041185304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:38,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:38,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:38,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365873427] [2023-11-29 04:18:38,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:38,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:18:38,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:38,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:18:38,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:18:38,078 INFO L87 Difference]: Start difference. First operand 1060 states and 1216 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 04:18:41,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:41,793 INFO L93 Difference]: Finished difference Result 1059 states and 1215 transitions. [2023-11-29 04:18:41,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:18:41,794 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 04:18:41,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:41,801 INFO L225 Difference]: With dead ends: 1059 [2023-11-29 04:18:41,801 INFO L226 Difference]: Without dead ends: 1059 [2023-11-29 04:18:41,801 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 04:18:41,802 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 3 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1582 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:41,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2113 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1582 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 04:18:41,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2023-11-29 04:18:41,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059. [2023-11-29 04:18:41,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1059 states, 629 states have (on average 1.9189189189189189) internal successors, (1207), 1053 states have internal predecessors, (1207), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1215 transitions. [2023-11-29 04:18:41,824 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1215 transitions. Word has length 58 [2023-11-29 04:18:41,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:41,824 INFO L495 AbstractCegarLoop]: Abstraction has 1059 states and 1215 transitions. [2023-11-29 04:18:41,824 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 04:18:41,825 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1215 transitions. [2023-11-29 04:18:41,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:18:41,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:41,826 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 04:18:41,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:42,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:42,026 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:42,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash -950660075, now seen corresponding path program 1 times [2023-11-29 04:18:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2019603935] [2023-11-29 04:18:42,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:42,028 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 04:18:42,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:42,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:42,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:42,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:18:42,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:42,359 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 04:18:42,382 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 04:18:42,395 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 04:18:42,437 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 04:18:42,458 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 04:18:42,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:42,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:42,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2019603935] [2023-11-29 04:18:42,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2019603935] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467501137] [2023-11-29 04:18:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:42,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:18:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:18:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:18:42,461 INFO L87 Difference]: Start difference. First operand 1059 states and 1215 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 04:18:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:46,834 INFO L93 Difference]: Finished difference Result 1058 states and 1214 transitions. [2023-11-29 04:18:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:18:46,835 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 04:18:46,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:46,841 INFO L225 Difference]: With dead ends: 1058 [2023-11-29 04:18:46,841 INFO L226 Difference]: Without dead ends: 1058 [2023-11-29 04:18:46,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:18:46,843 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 1 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2168 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:46,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2168 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-11-29 04:18:46,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2023-11-29 04:18:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1058. [2023-11-29 04:18:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 628 states have (on average 1.9203821656050954) internal successors, (1206), 1052 states have internal predecessors, (1206), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:18:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1214 transitions. [2023-11-29 04:18:46,858 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1214 transitions. Word has length 58 [2023-11-29 04:18:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:46,858 INFO L495 AbstractCegarLoop]: Abstraction has 1058 states and 1214 transitions. [2023-11-29 04:18:46,858 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 04:18:46,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1214 transitions. [2023-11-29 04:18:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:18:46,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:46,859 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 04:18:46,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:47,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:47,060 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:47,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:47,061 INFO L85 PathProgramCache]: Analyzing trace with hash 777135672, now seen corresponding path program 1 times [2023-11-29 04:18:47,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:47,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1400204040] [2023-11-29 04:18:47,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:47,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:18:47,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:47,062 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:47,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:47,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:18:47,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:47,433 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 04:18:47,433 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:47,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:47,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1400204040] [2023-11-29 04:18:47,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1400204040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:47,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:47,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:18:47,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178384378] [2023-11-29 04:18:47,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:47,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:18:47,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:47,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:18:47,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:18:47,436 INFO L87 Difference]: Start difference. First operand 1058 states and 1214 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 04:18:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:48,651 INFO L93 Difference]: Finished difference Result 1060 states and 1217 transitions. [2023-11-29 04:18:48,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:18:48,653 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 04:18:48,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:48,662 INFO L225 Difference]: With dead ends: 1060 [2023-11-29 04:18:48,662 INFO L226 Difference]: Without dead ends: 1060 [2023-11-29 04:18:48,662 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 04:18:48,663 INFO L413 NwaCegarLoop]: 822 mSDtfsCounter, 1 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:48,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2463 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:18:48,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2023-11-29 04:18:48,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1060. [2023-11-29 04:18:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 629 states have (on average 1.9205087440381559) internal successors, (1208), 1054 states have internal predecessors, (1208), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:18:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1217 transitions. [2023-11-29 04:18:48,682 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1217 transitions. Word has length 64 [2023-11-29 04:18:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:48,683 INFO L495 AbstractCegarLoop]: Abstraction has 1060 states and 1217 transitions. [2023-11-29 04:18:48,683 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 04:18:48,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1217 transitions. [2023-11-29 04:18:48,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 04:18:48,684 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:48,685 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 04:18:48,690 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:18:48,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:48,886 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:48,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash -2096879574, now seen corresponding path program 1 times [2023-11-29 04:18:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:48,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [949103955] [2023-11-29 04:18:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:48,887 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 04:18:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:48,888 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:48,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:49,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:49,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:18:49,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:49,232 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 04:18:49,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:18:49,304 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 04:18:49,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:49,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [949103955] [2023-11-29 04:18:49,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [949103955] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:18:49,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:18:49,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:18:49,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723559443] [2023-11-29 04:18:49,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:18:49,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:18:49,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:18:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:18:49,308 INFO L87 Difference]: Start difference. First operand 1060 states and 1217 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 04:18:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:51,549 INFO L93 Difference]: Finished difference Result 1069 states and 1231 transitions. [2023-11-29 04:18:51,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:18:51,550 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 04:18:51,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:51,556 INFO L225 Difference]: With dead ends: 1069 [2023-11-29 04:18:51,556 INFO L226 Difference]: Without dead ends: 1069 [2023-11-29 04:18:51,557 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 04:18:51,557 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 6 mSDsluCounter, 4095 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4916 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:51,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4916 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 04:18:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2023-11-29 04:18:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 1068. [2023-11-29 04:18:51,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1068 states, 636 states have (on average 1.919811320754717) internal successors, (1221), 1061 states have internal predecessors, (1221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:18:51,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 1230 transitions. [2023-11-29 04:18:51,577 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 1230 transitions. Word has length 65 [2023-11-29 04:18:51,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:51,577 INFO L495 AbstractCegarLoop]: Abstraction has 1068 states and 1230 transitions. [2023-11-29 04:18:51,577 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 04:18:51,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 1230 transitions. [2023-11-29 04:18:51,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 04:18:51,578 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:51,578 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 04:18:51,583 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:51,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:51,778 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:51,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:51,779 INFO L85 PathProgramCache]: Analyzing trace with hash -876866888, now seen corresponding path program 2 times [2023-11-29 04:18:51,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:51,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [808637370] [2023-11-29 04:18:51,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:18:51,780 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 04:18:51,780 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:51,781 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:51,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:52,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:18:52,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:18:52,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:18:52,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:52,499 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 04:18:52,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:18:52,677 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 04:18:52,677 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [808637370] [2023-11-29 04:18:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [808637370] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:18:52,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:18:52,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 04:18:52,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403253336] [2023-11-29 04:18:52,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:18:52,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:18:52,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:52,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:18:52,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:18:52,679 INFO L87 Difference]: Start difference. First operand 1068 states and 1230 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 04:18:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:18:55,951 INFO L93 Difference]: Finished difference Result 1083 states and 1252 transitions. [2023-11-29 04:18:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:18:55,952 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 04:18:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:18:55,957 INFO L225 Difference]: With dead ends: 1083 [2023-11-29 04:18:55,957 INFO L226 Difference]: Without dead ends: 1081 [2023-11-29 04:18:55,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:18:55,958 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 13 mSDsluCounter, 5737 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6558 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:18:55,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6558 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 04:18:55,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2023-11-29 04:18:55,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1077. [2023-11-29 04:18:55,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 645 states have (on average 1.9116279069767441) internal successors, (1233), 1070 states have internal predecessors, (1233), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:18:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1242 transitions. [2023-11-29 04:18:55,973 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1242 transitions. Word has length 68 [2023-11-29 04:18:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:18:55,973 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1242 transitions. [2023-11-29 04:18:55,973 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 04:18:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1242 transitions. [2023-11-29 04:18:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 04:18:55,974 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:18:55,974 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 04:18:55,981 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 04:18:56,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:56,175 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:18:56,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:56,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1952858760, now seen corresponding path program 3 times [2023-11-29 04:18:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576157211] [2023-11-29 04:18:56,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:18:56,177 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 04:18:56,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:56,178 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:56,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:18:57,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 04:18:57,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:18:57,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:18:57,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:57,211 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 04:18:57,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:18:57,985 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 04:18:57,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:57,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576157211] [2023-11-29 04:18:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576157211] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:18:57,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:18:57,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 04:18:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492545600] [2023-11-29 04:18:57,986 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:18:57,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:18:57,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:57,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:18:57,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:18:57,988 INFO L87 Difference]: Start difference. First operand 1077 states and 1242 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 04:19:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:05,312 INFO L93 Difference]: Finished difference Result 1107 states and 1292 transitions. [2023-11-29 04:19:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 04:19:05,313 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 04:19:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:05,319 INFO L225 Difference]: With dead ends: 1107 [2023-11-29 04:19:05,319 INFO L226 Difference]: Without dead ends: 1104 [2023-11-29 04:19:05,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 04:19:05,321 INFO L413 NwaCegarLoop]: 820 mSDtfsCounter, 25 mSDsluCounter, 9825 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10645 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:05,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10645 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2023-11-29 04:19:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2023-11-29 04:19:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1095. [2023-11-29 04:19:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1095 states, 663 states have (on average 1.894419306184012) internal successors, (1256), 1088 states have internal predecessors, (1256), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:19:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1265 transitions. [2023-11-29 04:19:05,351 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1265 transitions. Word has length 74 [2023-11-29 04:19:05,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:05,352 INFO L495 AbstractCegarLoop]: Abstraction has 1095 states and 1265 transitions. [2023-11-29 04:19:05,352 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 04:19:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1265 transitions. [2023-11-29 04:19:05,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 04:19:05,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:05,353 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 04:19:05,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 04:19:05,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:19:05,554 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:19:05,554 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:05,554 INFO L85 PathProgramCache]: Analyzing trace with hash -2102402312, now seen corresponding path program 4 times [2023-11-29 04:19:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:05,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321157459] [2023-11-29 04:19:05,555 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:19:05,555 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 04:19:05,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:05,556 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:19:05,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 04:19:06,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:19:06,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:06,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:19:06,035 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:06,476 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 04:19:06,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:08,428 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 04:19:08,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:08,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321157459] [2023-11-29 04:19:08,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321157459] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:08,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:08,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 04:19:08,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650247235] [2023-11-29 04:19:08,429 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:08,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 04:19:08,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:08,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 04:19:08,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 04:19:08,433 INFO L87 Difference]: Start difference. First operand 1095 states and 1265 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 04:19:26,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:19:26,030 INFO L93 Difference]: Finished difference Result 1152 states and 1354 transitions. [2023-11-29 04:19:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 04:19:26,031 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 04:19:26,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:19:26,036 INFO L225 Difference]: With dead ends: 1152 [2023-11-29 04:19:26,036 INFO L226 Difference]: Without dead ends: 1150 [2023-11-29 04:19:26,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 04:19:26,042 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 48 mSDsluCounter, 18860 mSDsCounter, 0 mSdLazyCounter, 4730 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 19681 SdHoareTripleChecker+Invalid, 4774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:19:26,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 19681 Invalid, 4774 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 4730 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-11-29 04:19:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2023-11-29 04:19:26,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1129. [2023-11-29 04:19:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 697 states have (on average 1.8680057388809181) internal successors, (1302), 1122 states have internal predecessors, (1302), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:19:26,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1311 transitions. [2023-11-29 04:19:26,065 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1311 transitions. Word has length 86 [2023-11-29 04:19:26,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:19:26,066 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1311 transitions. [2023-11-29 04:19:26,066 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 04:19:26,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1311 transitions. [2023-11-29 04:19:26,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:19:26,067 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:19:26,067 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 04:19:26,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 04:19:26,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:19:26,268 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:19:26,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:26,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1794404424, now seen corresponding path program 5 times [2023-11-29 04:19:26,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:26,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621085468] [2023-11-29 04:19:26,270 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:19:26,270 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 04:19:26,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:26,271 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:19:26,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:19:27,857 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:19:27,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:27,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 04:19:27,901 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:27,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:19:28,054 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:19:28,055 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 04:19:28,099 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 04:19:28,207 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 04:19:29,285 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:19:29,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:19:29,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:19:29,371 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 04:19:29,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:29,871 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2023) |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 04:19:29,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:29,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621085468] [2023-11-29 04:19:29,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621085468] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:19:29,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [734095378] [2023-11-29 04:19:29,874 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:19:29,874 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:19:29,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:19:29,875 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:19:29,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 04:20:43,671 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:20:43,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:20:43,899 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 04:20:43,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:20:43,915 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 04:20:44,167 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:20:44,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:20:44,224 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 04:20:44,358 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 04:20:45,191 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:20:45,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:20:45,272 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 04:20:45,283 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 04:20:45,283 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:20:45,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2485) |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 04:20:45,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [734095378] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:20:45,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:20:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 04:20:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135715034] [2023-11-29 04:20:45,694 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:20:45,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:20:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:20:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:20:45,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 04:20:45,696 INFO L87 Difference]: Start difference. First operand 1129 states and 1311 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 04:20:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:20:53,760 INFO L93 Difference]: Finished difference Result 1482 states and 1780 transitions. [2023-11-29 04:20:53,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:20:53,762 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 04:20:53,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:20:53,765 INFO L225 Difference]: With dead ends: 1482 [2023-11-29 04:20:53,765 INFO L226 Difference]: Without dead ends: 1480 [2023-11-29 04:20:53,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2023-11-29 04:20:53,766 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 636 mSDsluCounter, 3076 mSDsCounter, 0 mSdLazyCounter, 3917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 3613 SdHoareTripleChecker+Invalid, 3922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:20:53,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 3613 Invalid, 3922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3917 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-11-29 04:20:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1480 states. [2023-11-29 04:20:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1480 to 1128. [2023-11-29 04:20:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 697 states have (on average 1.860832137733142) internal successors, (1297), 1121 states have internal predecessors, (1297), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:20:53,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1306 transitions. [2023-11-29 04:20:53,783 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1306 transitions. Word has length 108 [2023-11-29 04:20:53,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:20:53,784 INFO L495 AbstractCegarLoop]: Abstraction has 1128 states and 1306 transitions. [2023-11-29 04:20:53,784 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 04:20:53,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1306 transitions. [2023-11-29 04:20:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:20:53,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:20:53,785 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 04:20:53,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 04:20:53,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:20:54,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:20:54,186 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:20:54,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:54,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1794404423, now seen corresponding path program 1 times [2023-11-29 04:20:54,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:20:54,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1089209916] [2023-11-29 04:20:54,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:54,187 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 04:20:54,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:20:54,188 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:20:54,189 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:20:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:20:54,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 04:20:54,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:20:54,994 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 04:20:55,107 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:20:55,107 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 04:20:55,113 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 04:20:55,140 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 04:20:55,157 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 04:20:55,263 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 04:20:55,268 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 04:20:56,011 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:20:56,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:20:56,026 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 04:20:56,075 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 04:20:56,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 04:20:56,111 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 04:20:56,112 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:20:57,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3039 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3038 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3039) |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~mem36#1.base| v_ArrVal_3038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:20:57,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:20:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1089209916] [2023-11-29 04:20:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1089209916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:20:57,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338686253] [2023-11-29 04:20:57,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:20:57,512 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:20:57,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:20:57,513 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:20:57,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 04:22:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:40,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 04:22:40,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:40,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:22:41,104 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:22:41,104 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 04:22:41,112 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 04:22:41,167 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 04:22:41,172 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 04:22:41,318 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 04:22:41,323 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 04:22:41,982 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:22:41,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:22:41,994 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 04:22:42,066 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 04:22:42,073 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 04:22:42,078 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 04:22:42,078 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:22:43,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3592) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3593 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3593) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 04:22:43,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [338686253] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:22:43,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:22:43,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 04:22:43,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046121738] [2023-11-29 04:22:43,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:22:43,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:22:43,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:22:43,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:22:43,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=172, Unknown=2, NotChecked=54, Total=272 [2023-11-29 04:22:43,395 INFO L87 Difference]: Start difference. First operand 1128 states and 1306 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 04:22:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:22:51,735 INFO L93 Difference]: Finished difference Result 1479 states and 1775 transitions. [2023-11-29 04:22:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:22:51,736 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 04:22:51,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:22:51,740 INFO L225 Difference]: With dead ends: 1479 [2023-11-29 04:22:51,740 INFO L226 Difference]: Without dead ends: 1479 [2023-11-29 04:22:51,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-11-29 04:22:51,741 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 1232 mSDsluCounter, 1733 mSDsCounter, 0 mSdLazyCounter, 3903 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1234 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:22:51,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1234 Valid, 2269 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3903 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2023-11-29 04:22:51,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2023-11-29 04:22:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 1127. [2023-11-29 04:22:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 697 states have (on average 1.8593974175035868) internal successors, (1296), 1120 states have internal predecessors, (1296), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:22:51,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1305 transitions. [2023-11-29 04:22:51,759 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1305 transitions. Word has length 108 [2023-11-29 04:22:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:22:51,759 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1305 transitions. [2023-11-29 04:22:51,760 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 04:22:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1305 transitions. [2023-11-29 04:22:51,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:22:51,761 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:22:51,761 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 04:22:51,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 04:22:51,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:22:52,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:52,162 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:22:52,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:22:52,162 INFO L85 PathProgramCache]: Analyzing trace with hash -2139149374, now seen corresponding path program 1 times [2023-11-29 04:22:52,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:22:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790442984] [2023-11-29 04:22:52,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:52,163 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 04:22:52,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:22:52,164 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:52,165 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:22:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:22:52,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 04:22:52,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:22:52,952 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 04:22:53,072 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:22:53,073 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 04:22:53,106 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 04:22:53,190 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 04:22:54,007 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:22:54,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:22:54,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:22:54,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:22:54,144 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 04:22:54,180 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 04:22:54,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:22:58,296 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4016 (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_4016) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:22:58,680 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4016)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:22:58,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:22:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790442984] [2023-11-29 04:22:58,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790442984] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:22:58,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1879296086] [2023-11-29 04:22:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:22:58,684 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:22:58,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:22:58,685 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:22:58,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 04:23:00,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:00,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 04:23:00,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:23:00,910 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 04:23:01,237 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:23:01,237 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 04:23:01,323 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 04:23:01,474 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 04:23:02,298 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:23:02,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:23:02,445 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:23:02,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:23:02,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:23:02,467 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 04:23:02,467 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:23:06,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4531 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4016 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4531))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4016)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:23:06,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1879296086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:23:06,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:23:06,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 04:23:06,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596125669] [2023-11-29 04:23:06,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:23:06,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:23:06,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:23:06,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:23:06,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=241, Unknown=5, NotChecked=102, Total=420 [2023-11-29 04:23:06,930 INFO L87 Difference]: Start difference. First operand 1127 states and 1305 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 04:23:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:23:17,302 INFO L93 Difference]: Finished difference Result 1478 states and 1774 transitions. [2023-11-29 04:23:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:23:17,304 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 04:23:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:23:17,306 INFO L225 Difference]: With dead ends: 1478 [2023-11-29 04:23:17,306 INFO L226 Difference]: Without dead ends: 1478 [2023-11-29 04:23:17,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 207 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=81, Invalid=268, Unknown=5, NotChecked=108, Total=462 [2023-11-29 04:23:17,307 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 629 mSDsluCounter, 3918 mSDsCounter, 0 mSdLazyCounter, 5035 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 4454 SdHoareTripleChecker+Invalid, 5041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:23:17,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 4454 Invalid, 5041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5035 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-11-29 04:23:17,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2023-11-29 04:23:17,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1126. [2023-11-29 04:23:17,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 697 states have (on average 1.8579626972740315) internal successors, (1295), 1119 states have internal predecessors, (1295), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:23:17,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1304 transitions. [2023-11-29 04:23:17,320 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1304 transitions. Word has length 110 [2023-11-29 04:23:17,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:23:17,320 INFO L495 AbstractCegarLoop]: Abstraction has 1126 states and 1304 transitions. [2023-11-29 04:23:17,321 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 04:23:17,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1304 transitions. [2023-11-29 04:23:17,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:23:17,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:23:17,322 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 04:23:17,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 04:23:17,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 04:23:17,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:23:17,722 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:23:17,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:23:17,723 INFO L85 PathProgramCache]: Analyzing trace with hash -2139149373, now seen corresponding path program 1 times [2023-11-29 04:23:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:23:17,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1788189178] [2023-11-29 04:23:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:17,723 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 04:23:17,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:23:17,724 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:17,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:23:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:23:18,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 04:23:18,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:23:18,545 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 04:23:18,650 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 04:23:18,666 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:23:18,666 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 04:23:18,688 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 04:23:18,692 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 04:23:18,791 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 04:23:18,796 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 04:23:19,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:23:19,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:23:19,481 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 04:23:19,599 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:23:19,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:23:19,605 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 04:23:19,632 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 04:23:19,637 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 04:23:19,670 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 04:23:19,670 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:23:19,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5001 (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_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5001) |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_5000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:23:19,875 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_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5000 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5001 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5001) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5000) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:23:21,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:23:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1788189178] [2023-11-29 04:23:21,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1788189178] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:23:21,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [103178247] [2023-11-29 04:23:21,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:23:21,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:23:21,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:23:21,897 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:23:21,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 04:25:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:03,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 04:25:03,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:03,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 7 [2023-11-29 04:25:03,526 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 04:25:03,546 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:25:03,546 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 04:25:03,625 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 04:25:03,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:25:03,831 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 04:25:03,837 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 04:25:04,560 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:04,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:25:04,566 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 04:25:04,781 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:04,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:25:04,790 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 04:25:04,810 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 04:25:04,815 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 04:25:04,821 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 04:25:04,821 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:25:04,876 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5562 (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_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:25:04,914 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_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:25:06,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5654) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5655) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5654 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5655))) (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~mem36#1.base| v_ArrVal_5654) .cse2 v_ArrVal_5562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:25:06,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [103178247] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:06,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:25:06,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 04:25:06,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166761374] [2023-11-29 04:25:06,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:25:06,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:25:06,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:25:06,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:25:06,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=11, NotChecked=180, Total=506 [2023-11-29 04:25:06,291 INFO L87 Difference]: Start difference. First operand 1126 states and 1304 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 04:25:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:25:18,940 INFO L93 Difference]: Finished difference Result 1477 states and 1773 transitions. [2023-11-29 04:25:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:25:18,942 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 04:25:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:25:18,944 INFO L225 Difference]: With dead ends: 1477 [2023-11-29 04:25:18,944 INFO L226 Difference]: Without dead ends: 1477 [2023-11-29 04:25:18,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=108, Invalid=407, Unknown=11, NotChecked=230, Total=756 [2023-11-29 04:25:18,945 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 1228 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 5177 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 2851 SdHoareTripleChecker+Invalid, 5194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:25:18,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 2851 Invalid, 5194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 5177 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2023-11-29 04:25:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2023-11-29 04:25:18,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 1125. [2023-11-29 04:25:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 697 states have (on average 1.8565279770444763) internal successors, (1294), 1118 states have internal predecessors, (1294), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:25:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1303 transitions. [2023-11-29 04:25:18,967 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1303 transitions. Word has length 110 [2023-11-29 04:25:18,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:25:18,967 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1303 transitions. [2023-11-29 04:25:18,967 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 04:25:18,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1303 transitions. [2023-11-29 04:25:18,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:25:18,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:25:18,968 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 04:25:18,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:25:19,202 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 04:25:19,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:25:19,369 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:25:19,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1568398183, now seen corresponding path program 1 times [2023-11-29 04:25:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:25:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1640273604] [2023-11-29 04:25:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:19,370 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 04:25:19,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:25:19,371 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:25:19,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:25:20,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:20,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 04:25:20,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:20,331 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 04:25:20,500 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:25:20,500 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 04:25:20,529 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 04:25:20,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:25:21,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:25:21,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:25:21,731 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:25:21,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:25:21,828 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:25:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:25:21,842 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 04:25:21,887 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 04:25:21,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:25:26,035 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6094 (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_6094) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:25:26,048 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (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_6093))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6094)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:25:26,062 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (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_6093))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6094)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:25:26,428 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6093 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6094 (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~mem36#1.base| v_ArrVal_6140))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6093)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6094)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:25:26,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:25:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1640273604] [2023-11-29 04:25:26,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1640273604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:26,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [450350563] [2023-11-29 04:25:26,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:25:26,432 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:25:26,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:25:26,433 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:25:26,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 04:25:52,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:25:52,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 04:25:52,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:52,787 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 04:25:53,175 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:25:53,176 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 04:25:53,260 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 04:25:53,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:25:54,342 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:54,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 36 treesize of output 35 [2023-11-29 04:25:54,549 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:54,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:25:54,674 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:25:54,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:25:54,689 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 04:25:54,698 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 04:25:54,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:25:54,714 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6579) |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 04:25:54,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6579 (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_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:25:54,742 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (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~mem38#1.base| v_ArrVal_6578))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:25:54,757 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (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_6578))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:25:55,202 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6625 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (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~mem36#1.base| v_ArrVal_6625))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6578)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6579)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:25:55,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [450350563] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:25:55,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:25:55,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 04:25:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110798735] [2023-11-29 04:25:55,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:25:55,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:25:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:25:55,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:25:55,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=308, Unknown=11, NotChecked=396, Total=812 [2023-11-29 04:25:55,209 INFO L87 Difference]: Start difference. First operand 1125 states and 1303 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 04:26:05,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:26:05,909 INFO L93 Difference]: Finished difference Result 1476 states and 1772 transitions. [2023-11-29 04:26:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:26:05,910 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 04:26:05,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:26:05,912 INFO L225 Difference]: With dead ends: 1476 [2023-11-29 04:26:05,912 INFO L226 Difference]: Without dead ends: 1476 [2023-11-29 04:26:05,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=106, Invalid=339, Unknown=11, NotChecked=414, Total=870 [2023-11-29 04:26:05,913 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 629 mSDsluCounter, 3697 mSDsCounter, 0 mSdLazyCounter, 4729 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 4232 SdHoareTripleChecker+Invalid, 4734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:26:05,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 4232 Invalid, 4734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4729 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2023-11-29 04:26:05,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2023-11-29 04:26:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1124. [2023-11-29 04:26:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1124 states, 697 states have (on average 1.855093256814921) internal successors, (1293), 1117 states have internal predecessors, (1293), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:26:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1302 transitions. [2023-11-29 04:26:05,941 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1302 transitions. Word has length 112 [2023-11-29 04:26:05,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:26:05,941 INFO L495 AbstractCegarLoop]: Abstraction has 1124 states and 1302 transitions. [2023-11-29 04:26:05,941 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 04:26:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1302 transitions. [2023-11-29 04:26:05,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:26:05,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:26:05,943 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 04:26:05,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:26:06,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 04:26:06,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:26:06,343 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:26:06,344 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:26:06,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1568398184, now seen corresponding path program 1 times [2023-11-29 04:26:06,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:26:06,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552656703] [2023-11-29 04:26:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:06,345 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 04:26:06,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:26:06,345 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:26:06,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:26:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:07,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 04:26:07,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:07,331 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 04:26:07,465 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 04:26:07,481 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:26:07,482 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 04:26:07,509 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 04:26:07,518 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 04:26:07,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 04:26:07,635 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 04:26:08,368 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:26:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:26:08,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:26:08,510 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:26:08,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:26:08,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:26:08,616 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:26:08,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:26:08,622 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 04:26:08,643 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 04:26:08,648 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 04:26:08,683 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 04:26:08,683 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:08,838 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7111) |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~mem39#1.base| v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7111) |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 04:26:08,880 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_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:26:08,957 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7110))) (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~mem38#1.base| v_ArrVal_7109) .cse0 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (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_7109) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 04:26:11,186 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7112 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7203))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7110))) (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~mem36#1.base| v_ArrVal_7204) .cse0 v_ArrVal_7109) .cse1 v_ArrVal_7111) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7112) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7110 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7109 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7204 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7111 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7203))) (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~mem36#1.base| v_ArrVal_7204) .cse6 v_ArrVal_7109) (select (select (store .cse7 .cse6 v_ArrVal_7110) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7111))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 04:26:11,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:26:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552656703] [2023-11-29 04:26:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552656703] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072706818] [2023-11-29 04:26:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:26:11,197 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:26:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:26:11,198 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:26:11,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 04:26:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:26:37,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 04:26:37,776 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:26:37,783 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 04:26:38,317 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:26:38,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:26:38,338 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 04:26:38,443 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 04:26:38,464 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 04:26:38,715 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 04:26:38,722 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 04:26:39,704 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:26:39,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:26:39,715 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 04:26:39,979 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:26:39,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:26:39,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:26:40,175 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:26:40,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:26:40,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:26:40,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:26:40,222 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 04:26:40,229 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 04:26:40,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:26:40,298 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7691) |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~mem39#1.base| v_ArrVal_7690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7691) |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 04:26:40,346 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_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7691) |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_7690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 04:26:40,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7689))) (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~mem38#1.base| v_ArrVal_7688) .cse0 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (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_7688) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7691) |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 04:26:40,452 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_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7688) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7689))) (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_7688) .cse3 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:26:41,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7783))) (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~mem36#1.base| v_ArrVal_7782) .cse1 v_ArrVal_7688) (select (select (store .cse2 .cse1 v_ArrVal_7689) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7691))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7783 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7782 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7783))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7689))) (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~mem36#1.base| v_ArrVal_7782) .cse4 v_ArrVal_7688) .cse5 v_ArrVal_7691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7690) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:26:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1072706818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:26:41,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:26:41,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 04:26:41,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599640522] [2023-11-29 04:26:41,853 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:26:41,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:26:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:26:41,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:26:41,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=314, Unknown=14, NotChecked=396, Total=812 [2023-11-29 04:26:41,855 INFO L87 Difference]: Start difference. First operand 1124 states and 1302 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 04:27:04,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:27:04,908 INFO L93 Difference]: Finished difference Result 1475 states and 1771 transitions. [2023-11-29 04:27:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:27:04,910 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 04:27:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:27:04,912 INFO L225 Difference]: With dead ends: 1475 [2023-11-29 04:27:04,912 INFO L226 Difference]: Without dead ends: 1475 [2023-11-29 04:27:04,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=146, Invalid=526, Unknown=14, NotChecked=504, Total=1190 [2023-11-29 04:27:04,913 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 1217 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 7090 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 7105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:27:04,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 3698 Invalid, 7105 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [15 Valid, 7090 Invalid, 0 Unknown, 0 Unchecked, 22.5s Time] [2023-11-29 04:27:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2023-11-29 04:27:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1123. [2023-11-29 04:27:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 697 states have (on average 1.853658536585366) internal successors, (1292), 1116 states have internal predecessors, (1292), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:27:04,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1301 transitions. [2023-11-29 04:27:04,923 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1301 transitions. Word has length 112 [2023-11-29 04:27:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:27:04,923 INFO L495 AbstractCegarLoop]: Abstraction has 1123 states and 1301 transitions. [2023-11-29 04:27:04,923 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 04:27:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1301 transitions. [2023-11-29 04:27:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:27:04,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:27:04,924 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 04:27:04,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:27:05,148 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 04:27:05,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:27:05,325 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:27:05,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:27:05,325 INFO L85 PathProgramCache]: Analyzing trace with hash -301260762, now seen corresponding path program 1 times [2023-11-29 04:27:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:27:05,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18018074] [2023-11-29 04:27:05,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:05,326 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 04:27:05,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:27:05,327 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:27:05,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:27:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:06,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 04:27:06,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:06,382 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 04:27:06,611 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:27:06,611 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 04:27:06,652 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 04:27:06,807 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 04:27:08,128 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:27:08,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:27:08,304 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:27:08,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:27:08,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:27:08,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:27:08,605 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:27:08,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:27:08,626 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 04:27:08,693 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 04:27:08,693 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:12,910 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8238 (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_8238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:27:12,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (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~mem39#1.base| v_ArrVal_8237))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:27:12,949 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (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_8237))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:27:12,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8236 (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_8236))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8237)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:27:12,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8236 (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_8236))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8237)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:27:13,523 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8237 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8236 (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~mem36#1.base| v_ArrVal_8284))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8236)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8237)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8238)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:27:13,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18018074] [2023-11-29 04:27:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18018074] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1725222369] [2023-11-29 04:27:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:27:13,530 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:27:13,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:27:13,531 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:27:13,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 04:27:48,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:27:48,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 04:27:48,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:27:48,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:27:49,441 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:27:49,442 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 04:27:49,545 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 04:27:49,796 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 04:27:50,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:27:50,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:27:51,228 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:27:51,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:27:51,408 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:27:51,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:27:51,568 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:27:51,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 04:27:51,598 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 04:27:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:27:51,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:27:51,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8739) |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 04:27:51,657 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (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_8739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:27:51,679 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (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~mem39#1.base| v_ArrVal_8738))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8739)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:27:51,701 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (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| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8738))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8739)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 04:27:51,725 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (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~mem38#1.base| v_ArrVal_8737))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8738)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8739)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:27:51,751 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (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_8737))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8738)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8739)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:27:52,255 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8785 (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~mem36#1.base| v_ArrVal_8785))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8737)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8738)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8739)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:27:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1725222369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:27:52,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 04:27:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639732387] [2023-11-29 04:27:52,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:52,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:27:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:27:52,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=380, Unknown=16, NotChecked=676, Total=1190 [2023-11-29 04:27:52,263 INFO L87 Difference]: Start difference. First operand 1123 states and 1301 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 04:28:05,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:28:05,764 INFO L93 Difference]: Finished difference Result 1474 states and 1770 transitions. [2023-11-29 04:28:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:28:05,766 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 04:28:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:28:05,769 INFO L225 Difference]: With dead ends: 1474 [2023-11-29 04:28:05,769 INFO L226 Difference]: Without dead ends: 1474 [2023-11-29 04:28:05,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=127, Invalid=415, Unknown=16, NotChecked=702, Total=1260 [2023-11-29 04:28:05,770 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 625 mSDsluCounter, 2970 mSDsCounter, 0 mSdLazyCounter, 3874 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 3504 SdHoareTripleChecker+Invalid, 3879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:28:05,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 3504 Invalid, 3879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3874 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2023-11-29 04:28:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2023-11-29 04:28:05,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1122. [2023-11-29 04:28:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 697 states have (on average 1.8522238163558107) internal successors, (1291), 1115 states have internal predecessors, (1291), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:28:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1300 transitions. [2023-11-29 04:28:05,790 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1300 transitions. Word has length 114 [2023-11-29 04:28:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:28:05,790 INFO L495 AbstractCegarLoop]: Abstraction has 1122 states and 1300 transitions. [2023-11-29 04:28:05,790 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 04:28:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1300 transitions. [2023-11-29 04:28:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:28:05,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:28:05,791 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 04:28:05,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:28:06,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 04:28:06,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:28:06,192 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:28:06,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:28:06,192 INFO L85 PathProgramCache]: Analyzing trace with hash -301260761, now seen corresponding path program 1 times [2023-11-29 04:28:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:28:06,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457836408] [2023-11-29 04:28:06,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:06,193 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 04:28:06,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:28:06,194 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:28:06,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:28:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:07,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 04:28:07,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:07,437 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 04:28:07,647 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 04:28:07,669 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:28:07,670 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 04:28:07,711 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 04:28:07,723 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 04:28:07,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 22 treesize of output 10 [2023-11-29 04:28:07,882 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 04:28:08,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:28:08,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:28:08,952 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 04:28:09,131 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:28:09,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:28:09,149 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 04:28:09,280 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:28:09,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:28:09,288 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 04:28:09,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:28:09,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:28:09,474 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 04:28:09,496 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 04:28:09,508 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 04:28:09,560 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 04:28:09,561 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:28:09,786 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (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_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (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_9288) |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~mem40#1.base| v_ArrVal_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:28:09,830 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_9288 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9288) |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_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:28:09,920 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9286) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9287))) (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~mem39#1.base| v_ArrVal_9286) .cse2 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:28:10,009 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_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9286) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9287))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9286) .cse3 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:28:11,010 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (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_9284))) (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_9285) .cse1 v_ArrVal_9286) (select (select (store .cse2 .cse1 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9288))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9284))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9287))) (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_9285) .cse4 v_ArrVal_9286) .cse5 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:28:12,342 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_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9284))) (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_9285) .cse2 v_ArrVal_9286) (select (select (store .cse3 .cse2 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9288))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9284))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9287))) (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_9285) .cse5 v_ArrVal_9286) .cse6 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:28:18,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9380 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9381))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9284))) (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~mem36#1.base| v_ArrVal_9380) .cse1 v_ArrVal_9285) .cse2 v_ArrVal_9286) (select (select (store .cse3 .cse2 v_ArrVal_9287) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9288))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9288 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9287 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9381 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9380 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9289 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9381))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9284))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9287))) (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~mem36#1.base| v_ArrVal_9380) .cse6 v_ArrVal_9285) .cse7 v_ArrVal_9286) .cse8 v_ArrVal_9288) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9289) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 04:28:18,313 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:28:18,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457836408] [2023-11-29 04:28:18,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457836408] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:28:18,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1494604106] [2023-11-29 04:28:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:28:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:28:18,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:28:18,314 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:28:18,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 04:28:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:28:55,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:28:55,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:28:55,246 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 04:28:57,976 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 04:28:58,134 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:28:58,134 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 04:28:58,563 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 04:28:58,615 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 04:28:59,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:28:59,950 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 04:29:04,872 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:04,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:29:04,949 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 04:29:06,117 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:06,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:29:06,196 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 04:29:07,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:07,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:29:07,089 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 04:29:07,904 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:29:07,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:29:07,956 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 04:29:08,063 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 04:29:08,115 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 04:29:08,117 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 04:29:08,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:29:08,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9884 (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_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (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_9884) |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~mem40#1.base| v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:29:08,459 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_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse2) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 04:29:08,728 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9883))) (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~mem39#1.base| v_ArrVal_9882) .cse0 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9882) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:29:09,006 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_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9882) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9883))) (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_9882) .cse3 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:29:09,760 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9881))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9883))) (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~mem38#1.base| v_ArrVal_9880) .cse0 v_ArrVal_9882) .cse1 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9881))) (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~mem38#1.base| v_ArrVal_9880) .cse6 v_ArrVal_9882) (select (select (store .cse7 .cse6 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9884))) |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 04:29:12,920 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_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9881))) (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_9880) .cse2 v_ArrVal_9882) (select (select (store .cse3 .cse2 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9884))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9881))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9883))) (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_9880) .cse5 v_ArrVal_9882) .cse6 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:29:21,257 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9885 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9977))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9881))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9883))) (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~mem36#1.base| v_ArrVal_9976) .cse0 v_ArrVal_9880) .cse1 v_ArrVal_9882) .cse2 v_ArrVal_9884) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9885) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9977 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9883 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9977))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9881))) (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~mem36#1.base| v_ArrVal_9976) .cse8 v_ArrVal_9880) .cse9 v_ArrVal_9882) (select (select (store .cse10 .cse9 v_ArrVal_9883) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9884))))) |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 04:29:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1494604106] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:29:21,292 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:29:21,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 04:29:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776105402] [2023-11-29 04:29:21,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:29:21,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:29:21,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:29:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:29:21,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=364, Unknown=14, NotChecked=714, Total=1190 [2023-11-29 04:29:21,294 INFO L87 Difference]: Start difference. First operand 1122 states and 1300 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 04:31:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:31:26,956 INFO L93 Difference]: Finished difference Result 1473 states and 1769 transitions. [2023-11-29 04:31:26,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:31:26,959 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 04:31:26,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:31:26,961 INFO L225 Difference]: With dead ends: 1473 [2023-11-29 04:31:26,961 INFO L226 Difference]: Without dead ends: 1473 [2023-11-29 04:31:26,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 21.7s TimeCoverageRelationStatistics Valid=161, Invalid=637, Unknown=14, NotChecked=910, Total=1722 [2023-11-29 04:31:26,963 INFO L413 NwaCegarLoop]: 534 mSDtfsCounter, 632 mSDsluCounter, 3721 mSDsCounter, 0 mSdLazyCounter, 7983 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 120.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 4255 SdHoareTripleChecker+Invalid, 7992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 7983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 123.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:31:26,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 4255 Invalid, 7992 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [9 Valid, 7983 Invalid, 0 Unknown, 0 Unchecked, 123.2s Time] [2023-11-29 04:31:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2023-11-29 04:31:26,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1121. [2023-11-29 04:31:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 697 states have (on average 1.8507890961262554) internal successors, (1290), 1114 states have internal predecessors, (1290), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:31:26,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1299 transitions. [2023-11-29 04:31:26,975 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1299 transitions. Word has length 114 [2023-11-29 04:31:26,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:31:26,975 INFO L495 AbstractCegarLoop]: Abstraction has 1121 states and 1299 transitions. [2023-11-29 04:31:26,975 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 04:31:26,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1299 transitions. [2023-11-29 04:31:26,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 04:31:26,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:31:26,976 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 04:31:26,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 04:31:27,203 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 04:31:27,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:31:27,377 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 631 more)] === [2023-11-29 04:31:27,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:31:27,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1747130547, now seen corresponding path program 1 times [2023-11-29 04:31:27,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:31:27,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452914386] [2023-11-29 04:31:27,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:27,378 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 04:31:27,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:31:27,379 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:31:27,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-29 04:31:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:31:28,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 04:31:28,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:31:28,886 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 04:31:30,628 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:31:30,628 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 04:31:30,908 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 04:31:31,666 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 04:31:38,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:38,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:31:39,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:39,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:31:40,221 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:40,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:31:40,946 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:40,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:31:41,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:31:41,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 04:31:41,790 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 04:31:42,127 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 04:31:42,127 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 04:31:42,576 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 04:31:42,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:31:43,412 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10450) |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 04:31:43,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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_10450) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:31:43,568 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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~mem40#1.base| v_ArrVal_10449))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:31:43,647 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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_10449))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:31:43,731 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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~mem39#1.base| v_ArrVal_10448))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:31:43,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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_10448))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:31:43,900 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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~mem38#1.base| v_ArrVal_10447))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:31:43,994 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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_10447))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:31:45,932 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10450 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10497 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10447 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10448 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10449 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#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~mem36#1.base| v_ArrVal_10497))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10447)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10448)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10449)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10450)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:31:45,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:31:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452914386] [2023-11-29 04:31:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452914386] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:31:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [724083326] [2023-11-29 04:31:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:31:45,954 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:31:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:31:45,955 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:31:45,956 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3e3570e3-de49-477a-b10c-8425cc1f8a9c/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 04:32:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:32:02,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 72 conjunts are in the unsatisfiable core [2023-11-29 04:32:02,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:32:02,094 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 04:32:05,478 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:32:05,478 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 04:32:06,134 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