./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/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_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/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 64bit --witnessprinter.graph.data.programhash 73081b3fa7e8ac6772d35cbb49ddbf2b46d162637b371c81319141218fe98c6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:11:56,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:11:56,421 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2023-11-29 05:11:56,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:11:56,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:11:56,448 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:11:56,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:11:56,449 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:11:56,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:11:56,450 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:11:56,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:11:56,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:11:56,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:11:56,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:11:56,453 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:11:56,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:11:56,454 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:11:56,455 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:11:56,455 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:11:56,456 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:11:56,456 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:11:56,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:11:56,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:11:56,458 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:11:56,458 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:11:56,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:11:56,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:11:56,460 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:11:56,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:11:56,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:11:56,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:11:56,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:11:56,462 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:11:56,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:11:56,462 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:11:56,462 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:11:56,463 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:11:56,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:11:56,463 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_2f955460-aa17-4bf2-a023-2517a4497a54/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_2f955460-aa17-4bf2-a023-2517a4497a54/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73081b3fa7e8ac6772d35cbb49ddbf2b46d162637b371c81319141218fe98c6a [2023-11-29 05:11:56,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:11:56,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:11:56,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:11:56,716 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:11:56,716 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:11:56,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2023-11-29 05:11:59,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:11:59,835 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:11:59,835 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2023-11-29 05:11:59,859 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data/f291a09c2/5568b998204447308a8717916c704e4f/FLAG7f8581c7a [2023-11-29 05:11:59,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data/f291a09c2/5568b998204447308a8717916c704e4f [2023-11-29 05:11:59,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:11:59,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:11:59,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:11:59,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:11:59,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:11:59,886 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:11:59" (1/1) ... [2023-11-29 05:11:59,887 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc82591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:11:59, skipping insertion in model container [2023-11-29 05:11:59,887 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:11:59" (1/1) ... [2023-11-29 05:11:59,957 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:12:00,966 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:00,990 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 05:12:00,991 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@207b2597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:00, skipping insertion in model container [2023-11-29 05:12:00,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:00,992 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 05:12:00,993 INFO L158 Benchmark]: Toolchain (without parser) took 1115.11ms. Allocated memory is still 174.1MB. Free memory was 132.9MB in the beginning and 104.5MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 05:12:00,994 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:12:00,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1112.48ms. Allocated memory is still 174.1MB. Free memory was 132.3MB in the beginning and 104.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-29 05:12:00,996 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 115.3MB. Free memory is still 65.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1112.48ms. Allocated memory is still 174.1MB. Free memory was 132.3MB in the beginning and 104.5MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2372]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/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_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/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 64bit --witnessprinter.graph.data.programhash 73081b3fa7e8ac6772d35cbb49ddbf2b46d162637b371c81319141218fe98c6a --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:12:02,760 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:12:02,849 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2023-11-29 05:12:02,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:12:02,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:12:02,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:12:02,887 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:12:02,888 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:12:02,888 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:12:02,889 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:12:02,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:12:02,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:12:02,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:12:02,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:12:02,892 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:12:02,893 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:12:02,893 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:12:02,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:12:02,894 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:12:02,895 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:12:02,895 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:12:02,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:12:02,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:12:02,897 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:12:02,897 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:12:02,898 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:12:02,898 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:12:02,899 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:12:02,899 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:12:02,900 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:12:02,900 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:12:02,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:12:02,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:12:02,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:12:02,901 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:12:02,902 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:12:02,902 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:12:02,902 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:12:02,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:12:02,903 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:12:02,903 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:12:02,903 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_2f955460-aa17-4bf2-a023-2517a4497a54/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_2f955460-aa17-4bf2-a023-2517a4497a54/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 73081b3fa7e8ac6772d35cbb49ddbf2b46d162637b371c81319141218fe98c6a [2023-11-29 05:12:03,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:12:03,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:12:03,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:12:03,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:12:03,219 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:12:03,221 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2023-11-29 05:12:06,106 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:12:06,468 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:12:06,468 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/sv-benchmarks/c/busybox-1.22.0/whoami-incomplete-2.i [2023-11-29 05:12:06,493 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data/ee382bd22/218c4539ca9940288e82c67369b240cb/FLAG64f4fb63c [2023-11-29 05:12:06,508 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/data/ee382bd22/218c4539ca9940288e82c67369b240cb [2023-11-29 05:12:06,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:12:06,512 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:12:06,514 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:06,514 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:12:06,519 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:12:06,520 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:12:06" (1/1) ... [2023-11-29 05:12:06,521 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a2844d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:06, skipping insertion in model container [2023-11-29 05:12:06,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:12:06" (1/1) ... [2023-11-29 05:12:06,589 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:12:07,561 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:07,585 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 05:12:07,609 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:12:07,697 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:07,708 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:12:07,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:12:08,059 WARN L675 CHandler]: The function fflush is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:12:08,060 WARN L675 CHandler]: The function puts is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:12:08,068 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:12:08,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08 WrapperNode [2023-11-29 05:12:08,069 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:12:08,070 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:12:08,070 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:12:08,070 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:12:08,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,182 INFO L138 Inliner]: procedures = 627, calls = 174, calls flagged for inlining = 19, calls inlined = 17, statements flattened = 511 [2023-11-29 05:12:08,183 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:12:08,184 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:12:08,184 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:12:08,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:12:08,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,204 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,215 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,232 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2023-11-29 05:12:08,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,269 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:12:08,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:12:08,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:12:08,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:12:08,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (1/1) ... [2023-11-29 05:12:08,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:12:08,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:12:08,347 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:12:08,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:12:08,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:12:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-29 05:12:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-29 05:12:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 05:12:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2023-11-29 05:12:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:12:08,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-29 05:12:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE8 [2023-11-29 05:12:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE2 [2023-11-29 05:12:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2023-11-29 05:12:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE1 [2023-11-29 05:12:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:12:08,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:12:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-29 05:12:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2023-11-29 05:12:08,391 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2023-11-29 05:12:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-29 05:12:08,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2023-11-29 05:12:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2023-11-29 05:12:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:12:08,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:12:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:12:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-29 05:12:08,392 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2023-11-29 05:12:08,393 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2023-11-29 05:12:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-29 05:12:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-29 05:12:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-29 05:12:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2023-11-29 05:12:08,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2 [2023-11-29 05:12:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-11-29 05:12:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE8 [2023-11-29 05:12:08,394 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2023-11-29 05:12:08,788 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:12:08,790 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:12:15,080 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:12:15,172 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:12:15,173 INFO L309 CfgBuilder]: Removed 9 assume(true) statements. [2023-11-29 05:12:15,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:12:15 BoogieIcfgContainer [2023-11-29 05:12:15,173 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:12:15,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:12:15,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:12:15,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:12:15,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:12:06" (1/3) ... [2023-11-29 05:12:15,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577ce377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:12:15, skipping insertion in model container [2023-11-29 05:12:15,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:12:08" (2/3) ... [2023-11-29 05:12:15,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577ce377 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:12:15, skipping insertion in model container [2023-11-29 05:12:15,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:12:15" (3/3) ... [2023-11-29 05:12:15,182 INFO L112 eAbstractionObserver]: Analyzing ICFG whoami-incomplete-2.i [2023-11-29 05:12:15,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:12:15,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 147 error locations. [2023-11-29 05:12:15,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:12:15,261 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;@241e3806, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:12:15,261 INFO L358 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2023-11-29 05:12:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 157 states have (on average 2.1974522292993632) internal successors, (345), 304 states have internal predecessors, (345), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:12:15,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 05:12:15,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:15,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 05:12:15,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:15,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:15,297 INFO L85 PathProgramCache]: Analyzing trace with hash 20871, now seen corresponding path program 1 times [2023-11-29 05:12:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [984784946] [2023-11-29 05:12:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:15,316 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 05:12:15,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:15,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:15,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:15,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:15,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:12:15,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:15,632 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 05:12:15,650 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 05:12:15,650 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:15,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:15,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [984784946] [2023-11-29 05:12:15,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [984784946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:15,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:15,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:12:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100957474] [2023-11-29 05:12:15,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:15,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:12:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:15,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:12:15,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:12:15,702 INFO L87 Difference]: Start difference. First operand has 317 states, 157 states have (on average 2.1974522292993632) internal successors, (345), 304 states have internal predecessors, (345), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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 05:12:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:17,434 INFO L93 Difference]: Finished difference Result 435 states and 488 transitions. [2023-11-29 05:12:17,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:12:17,438 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 05:12:17,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:17,450 INFO L225 Difference]: With dead ends: 435 [2023-11-29 05:12:17,450 INFO L226 Difference]: Without dead ends: 434 [2023-11-29 05:12:17,452 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 05:12:17,455 INFO L413 NwaCegarLoop]: 233 mSDtfsCounter, 279 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:17,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 332 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 05:12:17,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-29 05:12:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 313. [2023-11-29 05:12:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 157 states have (on average 2.1019108280254777) internal successors, (330), 300 states have internal predecessors, (330), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:12:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 348 transitions. [2023-11-29 05:12:17,508 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 348 transitions. Word has length 2 [2023-11-29 05:12:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:17,508 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 348 transitions. [2023-11-29 05:12:17,508 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 05:12:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 348 transitions. [2023-11-29 05:12:17,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 05:12:17,509 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:17,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 05:12:17,515 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:17,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:17,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:17,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:17,711 INFO L85 PathProgramCache]: Analyzing trace with hash 20872, now seen corresponding path program 1 times [2023-11-29 05:12:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:17,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66255943] [2023-11-29 05:12:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:17,713 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 05:12:17,713 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:17,715 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:17,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:17,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:12:17,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:17,909 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 05:12:17,935 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 05:12:17,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:17,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:17,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66255943] [2023-11-29 05:12:17,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66255943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:17,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:12:17,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465285784] [2023-11-29 05:12:17,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:17,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:12:17,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:17,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:12:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:12:17,939 INFO L87 Difference]: Start difference. First operand 313 states and 348 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 05:12:19,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:19,772 INFO L93 Difference]: Finished difference Result 312 states and 347 transitions. [2023-11-29 05:12:19,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:12:19,774 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 05:12:19,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:19,778 INFO L225 Difference]: With dead ends: 312 [2023-11-29 05:12:19,778 INFO L226 Difference]: Without dead ends: 312 [2023-11-29 05:12:19,778 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 05:12:19,780 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 9 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:19,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 488 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 05:12:19,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2023-11-29 05:12:19,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2023-11-29 05:12:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 157 states have (on average 2.0955414012738856) internal successors, (329), 299 states have internal predecessors, (329), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:12:19,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 347 transitions. [2023-11-29 05:12:19,802 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 347 transitions. Word has length 2 [2023-11-29 05:12:19,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:19,803 INFO L495 AbstractCegarLoop]: Abstraction has 312 states and 347 transitions. [2023-11-29 05:12:19,803 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 05:12:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 347 transitions. [2023-11-29 05:12:19,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 05:12:19,804 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:19,804 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 05:12:19,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:20,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:20,005 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:20,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:20,005 INFO L85 PathProgramCache]: Analyzing trace with hash 20609255, now seen corresponding path program 1 times [2023-11-29 05:12:20,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:20,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166988442] [2023-11-29 05:12:20,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:20,007 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 05:12:20,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:20,008 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:20,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:20,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:12:20,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:20,185 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 05:12:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:20,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:20,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:20,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1166988442] [2023-11-29 05:12:20,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1166988442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:20,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:20,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:12:20,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729762654] [2023-11-29 05:12:20,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:20,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:12:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:20,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:12:20,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:12:20,273 INFO L87 Difference]: Start difference. First operand 312 states and 347 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:12:22,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:22,270 INFO L93 Difference]: Finished difference Result 314 states and 349 transitions. [2023-11-29 05:12:22,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:12:22,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 05:12:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:22,274 INFO L225 Difference]: With dead ends: 314 [2023-11-29 05:12:22,274 INFO L226 Difference]: Without dead ends: 314 [2023-11-29 05:12:22,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 05:12:22,275 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 9 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:22,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 488 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 05:12:22,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-11-29 05:12:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2023-11-29 05:12:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 159 states have (on average 2.0817610062893084) internal successors, (331), 301 states have internal predecessors, (331), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:12:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 349 transitions. [2023-11-29 05:12:22,293 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 349 transitions. Word has length 4 [2023-11-29 05:12:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:22,293 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 349 transitions. [2023-11-29 05:12:22,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:12:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 349 transitions. [2023-11-29 05:12:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 05:12:22,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:22,295 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2023-11-29 05:12:22,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:22,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:22,498 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:22,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:22,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1668800772, now seen corresponding path program 1 times [2023-11-29 05:12:22,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:22,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1876581842] [2023-11-29 05:12:22,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:22,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:12:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:22,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:22,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:22,664 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:12:22,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:22,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 05:12:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:22,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:23,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:23,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1876581842] [2023-11-29 05:12:23,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1876581842] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:12:23,564 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:12:23,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-29 05:12:23,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851646827] [2023-11-29 05:12:23,565 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:12:23,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:12:23,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:23,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:12:23,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:12:23,566 INFO L87 Difference]: Start difference. First operand 314 states and 349 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 05:12:33,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:33,375 INFO L93 Difference]: Finished difference Result 316 states and 351 transitions. [2023-11-29 05:12:33,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:12:33,378 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 6 [2023-11-29 05:12:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:33,379 INFO L225 Difference]: With dead ends: 316 [2023-11-29 05:12:33,379 INFO L226 Difference]: Without dead ends: 316 [2023-11-29 05:12:33,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:33,380 INFO L413 NwaCegarLoop]: 297 mSDtfsCounter, 10 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:33,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1055 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2023-11-29 05:12:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-29 05:12:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2023-11-29 05:12:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 162 states have (on average 2.0555555555555554) internal successors, (333), 303 states have internal predecessors, (333), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:12:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 351 transitions. [2023-11-29 05:12:33,389 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 351 transitions. Word has length 6 [2023-11-29 05:12:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:33,389 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 351 transitions. [2023-11-29 05:12:33,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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 05:12:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 351 transitions. [2023-11-29 05:12:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 05:12:33,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:33,390 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1] [2023-11-29 05:12:33,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:33,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:33,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:33,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:33,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1699889426, now seen corresponding path program 1 times [2023-11-29 05:12:33,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:33,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131664515] [2023-11-29 05:12:33,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:33,592 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 05:12:33,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:33,594 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:33,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:33,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:33,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:12:33,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:33,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:34,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:34,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131664515] [2023-11-29 05:12:34,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131664515] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:12:34,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:12:34,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 05:12:34,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175145044] [2023-11-29 05:12:34,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:12:34,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:12:34,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:34,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:12:34,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:12:34,003 INFO L87 Difference]: Start difference. First operand 316 states and 351 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:12:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:35,689 INFO L93 Difference]: Finished difference Result 326 states and 361 transitions. [2023-11-29 05:12:35,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:12:35,691 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 05:12:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:35,692 INFO L225 Difference]: With dead ends: 326 [2023-11-29 05:12:35,692 INFO L226 Difference]: Without dead ends: 326 [2023-11-29 05:12:35,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:12:35,694 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 6 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1497 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:35,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1497 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 05:12:35,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-29 05:12:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2023-11-29 05:12:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 172 states have (on average 1.994186046511628) internal successors, (343), 313 states have internal predecessors, (343), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-29 05:12:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 361 transitions. [2023-11-29 05:12:35,702 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 361 transitions. Word has length 11 [2023-11-29 05:12:35,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:35,702 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 361 transitions. [2023-11-29 05:12:35,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:12:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 361 transitions. [2023-11-29 05:12:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:12:35,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:35,703 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 05:12:35,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 05:12:35,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:35,904 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:35,905 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1259406565, now seen corresponding path program 2 times [2023-11-29 05:12:35,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:35,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869237442] [2023-11-29 05:12:35,907 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:12:35,908 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 05:12:35,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:35,910 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:35,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:36,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:12:36,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:12:36,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:12:36,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:36,161 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:12:36,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:12:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:12:36,528 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:36,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:36,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869237442] [2023-11-29 05:12:36,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869237442] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:36,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:36,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:12:36,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692483777] [2023-11-29 05:12:36,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:36,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:12:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:36,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:12:36,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:12:36,530 INFO L87 Difference]: Start difference. First operand 326 states and 361 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 05:12:39,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:39,059 INFO L93 Difference]: Finished difference Result 467 states and 518 transitions. [2023-11-29 05:12:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:12:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 21 [2023-11-29 05:12:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:39,064 INFO L225 Difference]: With dead ends: 467 [2023-11-29 05:12:39,064 INFO L226 Difference]: Without dead ends: 467 [2023-11-29 05:12:39,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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 05:12:39,064 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 308 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:39,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 356 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 05:12:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-11-29 05:12:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 386. [2023-11-29 05:12:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 225 states have (on average 2.017777777777778) internal successors, (454), 365 states have internal predecessors, (454), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:12:39,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 482 transitions. [2023-11-29 05:12:39,075 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 482 transitions. Word has length 21 [2023-11-29 05:12:39,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:39,076 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 482 transitions. [2023-11-29 05:12:39,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 05:12:39,076 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 482 transitions. [2023-11-29 05:12:39,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 05:12:39,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:39,077 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1] [2023-11-29 05:12:39,081 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 05:12:39,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:39,278 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:39,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1259406566, now seen corresponding path program 1 times [2023-11-29 05:12:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:39,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [826436631] [2023-11-29 05:12:39,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:39,279 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 05:12:39,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:39,280 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:39,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,519 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:12:39,521 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:39,711 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:12:40,096 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:12:40,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:40,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [826436631] [2023-11-29 05:12:40,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [826436631] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:12:40,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:12:40,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 05:12:40,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661616226] [2023-11-29 05:12:40,097 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:12:40,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:12:40,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:40,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:12:40,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:12:40,099 INFO L87 Difference]: Start difference. First operand 386 states and 482 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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 05:12:43,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:43,814 INFO L93 Difference]: Finished difference Result 390 states and 486 transitions. [2023-11-29 05:12:43,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 05:12:43,817 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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 21 [2023-11-29 05:12:43,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:43,821 INFO L225 Difference]: With dead ends: 390 [2023-11-29 05:12:43,821 INFO L226 Difference]: Without dead ends: 390 [2023-11-29 05:12:43,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:12:43,822 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 3 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3280 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:43,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3280 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 05:12:43,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-11-29 05:12:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2023-11-29 05:12:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 229 states have (on average 2.0) internal successors, (458), 369 states have internal predecessors, (458), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:12:43,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 486 transitions. [2023-11-29 05:12:43,840 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 486 transitions. Word has length 21 [2023-11-29 05:12:43,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:43,840 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 486 transitions. [2023-11-29 05:12:43,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 20 states have internal predecessors, (39), 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 05:12:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 486 transitions. [2023-11-29 05:12:43,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 05:12:43,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:43,841 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1] [2023-11-29 05:12:43,849 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:44,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:44,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:44,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:44,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1126769860, now seen corresponding path program 2 times [2023-11-29 05:12:44,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:44,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223319249] [2023-11-29 05:12:44,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:12:44,044 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 05:12:44,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:44,045 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:44,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:44,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:12:44,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:12:44,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 05:12:44,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:44,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:44,284 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 05:12:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:12:44,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:44,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:44,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223319249] [2023-11-29 05:12:44,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223319249] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:44,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:44,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:12:44,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458335286] [2023-11-29 05:12:44,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:44,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:12:44,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:44,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:12:44,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:12:44,707 INFO L87 Difference]: Start difference. First operand 390 states and 486 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 05:12:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:46,541 INFO L93 Difference]: Finished difference Result 393 states and 488 transitions. [2023-11-29 05:12:46,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:12:46,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 25 [2023-11-29 05:12:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:46,545 INFO L225 Difference]: With dead ends: 393 [2023-11-29 05:12:46,545 INFO L226 Difference]: Without dead ends: 393 [2023-11-29 05:12:46,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 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 05:12:46,546 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 6 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:46,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 494 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 05:12:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2023-11-29 05:12:46,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2023-11-29 05:12:46,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 232 states have (on average 1.9827586206896552) internal successors, (460), 371 states have internal predecessors, (460), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:12:46,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 488 transitions. [2023-11-29 05:12:46,555 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 488 transitions. Word has length 25 [2023-11-29 05:12:46,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:46,555 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 488 transitions. [2023-11-29 05:12:46,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 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 05:12:46,556 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 488 transitions. [2023-11-29 05:12:46,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:12:46,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:46,556 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:46,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 05:12:46,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:46,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:46,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash -2127107124, now seen corresponding path program 1 times [2023-11-29 05:12:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:46,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746593242] [2023-11-29 05:12:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:46,759 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 05:12:46,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:46,759 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:46,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:47,284 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:12:47,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:47,324 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:12:47,324 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 05:12:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:12:47,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:47,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746593242] [2023-11-29 05:12:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746593242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:47,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:12:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73122504] [2023-11-29 05:12:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:47,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:12:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:47,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:12:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:12:47,367 INFO L87 Difference]: Start difference. First operand 393 states and 488 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:12:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:50,165 INFO L93 Difference]: Finished difference Result 463 states and 519 transitions. [2023-11-29 05:12:50,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:12:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 32 [2023-11-29 05:12:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:50,170 INFO L225 Difference]: With dead ends: 463 [2023-11-29 05:12:50,170 INFO L226 Difference]: Without dead ends: 463 [2023-11-29 05:12:50,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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 05:12:50,171 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 264 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:50,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 357 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 05:12:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2023-11-29 05:12:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 388. [2023-11-29 05:12:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 232 states have (on average 1.9612068965517242) internal successors, (455), 366 states have internal predecessors, (455), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:12:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 483 transitions. [2023-11-29 05:12:50,181 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 483 transitions. Word has length 32 [2023-11-29 05:12:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:50,181 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 483 transitions. [2023-11-29 05:12:50,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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 05:12:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 483 transitions. [2023-11-29 05:12:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 05:12:50,182 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:50,182 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:50,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:50,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:50,383 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:50,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:50,384 INFO L85 PathProgramCache]: Analyzing trace with hash -2127107123, now seen corresponding path program 1 times [2023-11-29 05:12:50,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:50,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712168537] [2023-11-29 05:12:50,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:50,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 05:12:50,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:50,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:50,386 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:50,877 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 05:12:50,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:50,986 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 05:12:50,986 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 05:12:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:12:51,115 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:51,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:51,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712168537] [2023-11-29 05:12:51,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712168537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:51,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:51,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:12:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757533425] [2023-11-29 05:12:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:51,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:12:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:12:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:12:51,118 INFO L87 Difference]: Start difference. First operand 388 states and 483 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 05:12:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:56,212 INFO L93 Difference]: Finished difference Result 454 states and 554 transitions. [2023-11-29 05:12:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:12:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 32 [2023-11-29 05:12:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:56,216 INFO L225 Difference]: With dead ends: 454 [2023-11-29 05:12:56,217 INFO L226 Difference]: Without dead ends: 454 [2023-11-29 05:12:56,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:12:56,217 INFO L413 NwaCegarLoop]: 263 mSDtfsCounter, 365 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:56,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 981 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2023-11-29 05:12:56,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-11-29 05:12:56,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 416. [2023-11-29 05:12:56,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 260 states have (on average 1.9730769230769232) internal successors, (513), 393 states have internal predecessors, (513), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:12:56,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 543 transitions. [2023-11-29 05:12:56,231 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 543 transitions. Word has length 32 [2023-11-29 05:12:56,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:56,231 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 543 transitions. [2023-11-29 05:12:56,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 05:12:56,231 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 543 transitions. [2023-11-29 05:12:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:12:56,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:56,232 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:56,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 05:12:56,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:56,433 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:12:56,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:56,434 INFO L85 PathProgramCache]: Analyzing trace with hash 255025437, now seen corresponding path program 1 times [2023-11-29 05:12:56,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:12:56,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741746889] [2023-11-29 05:12:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:56,439 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 05:12:56,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:12:56,440 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:56,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:12:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:56,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:12:56,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:12:56,970 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 05:12:56,970 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 1 case distinctions, treesize of input 19 treesize of output 21 [2023-11-29 05:12:57,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:12:57,315 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-29 05:12:57,315 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 29 treesize of output 31 [2023-11-29 05:12:57,347 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:12:57,347 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 05:12:57,494 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:12:57,494 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:12:57,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:12:57,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741746889] [2023-11-29 05:12:57,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741746889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:57,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:12:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819451069] [2023-11-29 05:12:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:12:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:12:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:12:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:12:57,495 INFO L87 Difference]: Start difference. First operand 416 states and 543 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 05:13:04,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:04,531 INFO L93 Difference]: Finished difference Result 470 states and 571 transitions. [2023-11-29 05:13:04,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:13:04,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 34 [2023-11-29 05:13:04,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:04,535 INFO L225 Difference]: With dead ends: 470 [2023-11-29 05:13:04,535 INFO L226 Difference]: Without dead ends: 470 [2023-11-29 05:13:04,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:04,536 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 482 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:04,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1142 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-29 05:13:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-11-29 05:13:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 426. [2023-11-29 05:13:04,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 270 states have (on average 1.962962962962963) internal successors, (530), 403 states have internal predecessors, (530), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:13:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 560 transitions. [2023-11-29 05:13:04,547 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 560 transitions. Word has length 34 [2023-11-29 05:13:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:04,547 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 560 transitions. [2023-11-29 05:13:04,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 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 05:13:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 560 transitions. [2023-11-29 05:13:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:13:04,548 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:04,548 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:04,557 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 05:13:04,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:04,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:13:04,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash 266841224, now seen corresponding path program 1 times [2023-11-29 05:13:04,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:04,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821028167] [2023-11-29 05:13:04,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:04,750 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 05:13:04,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:04,751 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:04,752 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:05,212 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:13:05,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:05,221 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 05:13:05,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:05,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-29 05:13:05,270 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 05:13:05,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 05:13:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:13:05,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:13:05,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821028167] [2023-11-29 05:13:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821028167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:05,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:05,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:13:05,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612499846] [2023-11-29 05:13:05,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:05,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:13:05,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:05,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:13:05,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:13:05,300 INFO L87 Difference]: Start difference. First operand 426 states and 560 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 05:13:06,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:06,594 INFO L93 Difference]: Finished difference Result 498 states and 596 transitions. [2023-11-29 05:13:06,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:13:06,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 36 [2023-11-29 05:13:06,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:06,599 INFO L225 Difference]: With dead ends: 498 [2023-11-29 05:13:06,599 INFO L226 Difference]: Without dead ends: 498 [2023-11-29 05:13:06,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 1 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 05:13:06,600 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 257 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:06,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 355 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 05:13:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2023-11-29 05:13:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 437. [2023-11-29 05:13:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 282 states have (on average 1.9432624113475176) internal successors, (548), 414 states have internal predecessors, (548), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:13:06,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 578 transitions. [2023-11-29 05:13:06,609 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 578 transitions. Word has length 36 [2023-11-29 05:13:06,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:06,610 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 578 transitions. [2023-11-29 05:13:06,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 05:13:06,610 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 578 transitions. [2023-11-29 05:13:06,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-29 05:13:06,611 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:06,611 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:06,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:06,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:06,812 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:13:06,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:06,812 INFO L85 PathProgramCache]: Analyzing trace with hash 266841225, now seen corresponding path program 1 times [2023-11-29 05:13:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582808094] [2023-11-29 05:13:06,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:06,813 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 05:13:06,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:06,814 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:06,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:07,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:13:07,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:07,522 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 11 treesize of output 10 [2023-11-29 05:13:07,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 05:13:07,558 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 16 treesize of output 10 [2023-11-29 05:13:07,564 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 11 treesize of output 7 [2023-11-29 05:13:07,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 05:13:07,822 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 19 treesize of output 14 [2023-11-29 05:13:07,855 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:13:07,856 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 05:13:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:13:08,001 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:13:08,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:08,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582808094] [2023-11-29 05:13:08,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [582808094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:08,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:08,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:13:08,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024020827] [2023-11-29 05:13:08,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:08,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:13:08,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:13:08,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:13:08,003 INFO L87 Difference]: Start difference. First operand 437 states and 578 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 05:13:17,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:17,685 INFO L93 Difference]: Finished difference Result 510 states and 605 transitions. [2023-11-29 05:13:17,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:13:17,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 36 [2023-11-29 05:13:17,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:17,689 INFO L225 Difference]: With dead ends: 510 [2023-11-29 05:13:17,689 INFO L226 Difference]: Without dead ends: 510 [2023-11-29 05:13:17,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:17,690 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 670 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:17,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 777 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-11-29 05:13:17,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-11-29 05:13:17,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 437. [2023-11-29 05:13:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 282 states have (on average 1.9326241134751774) internal successors, (545), 414 states have internal predecessors, (545), 15 states have call successors, (15), 7 states have call predecessors, (15), 7 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:13:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 575 transitions. [2023-11-29 05:13:17,700 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 575 transitions. Word has length 36 [2023-11-29 05:13:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:17,701 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 575 transitions. [2023-11-29 05:13:17,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 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 05:13:17,701 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 575 transitions. [2023-11-29 05:13:17,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:13:17,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:17,702 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:17,715 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:17,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:17,902 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:13:17,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:17,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1263092977, now seen corresponding path program 1 times [2023-11-29 05:13:17,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:17,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367987618] [2023-11-29 05:13:17,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:17,904 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 05:13:17,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:17,905 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:17,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:18,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 05:13:18,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:18,550 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 05:13:18,603 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 21 treesize of output 1 [2023-11-29 05:13:18,751 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-29 05:13:18,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 28 [2023-11-29 05:13:18,854 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 05:13:18,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 42 treesize of output 14 [2023-11-29 05:13:18,886 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:13:18,886 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:13:18,886 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:18,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367987618] [2023-11-29 05:13:18,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367987618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:18,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:18,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:13:18,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425871588] [2023-11-29 05:13:18,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:18,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:13:18,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:18,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:13:18,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:13:18,887 INFO L87 Difference]: Start difference. First operand 437 states and 575 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 05:13:26,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:13:30,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:13:34,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:13:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:35,379 INFO L93 Difference]: Finished difference Result 434 states and 570 transitions. [2023-11-29 05:13:35,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:13:35,380 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 38 [2023-11-29 05:13:35,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:35,382 INFO L225 Difference]: With dead ends: 434 [2023-11-29 05:13:35,382 INFO L226 Difference]: Without dead ends: 434 [2023-11-29 05:13:35,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:13:35,383 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 298 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:35,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 777 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 552 Invalid, 3 Unknown, 0 Unchecked, 16.4s Time] [2023-11-29 05:13:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-11-29 05:13:35,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 398. [2023-11-29 05:13:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 247 states have (on average 1.9109311740890689) internal successors, (472), 376 states have internal predecessors, (472), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:13:35,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 500 transitions. [2023-11-29 05:13:35,390 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 500 transitions. Word has length 38 [2023-11-29 05:13:35,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:35,391 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 500 transitions. [2023-11-29 05:13:35,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 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 05:13:35,391 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 500 transitions. [2023-11-29 05:13:35,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 05:13:35,391 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:35,391 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:35,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:35,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:35,592 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:13:35,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:35,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1263092976, now seen corresponding path program 1 times [2023-11-29 05:13:35,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1823806691] [2023-11-29 05:13:35,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:35,594 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 05:13:35,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:35,595 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:35,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:36,218 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:13:36,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:36,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:13:36,260 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 05:13:36,321 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 16 treesize of output 12 [2023-11-29 05:13:36,351 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 25 treesize of output 1 [2023-11-29 05:13:36,440 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 23 treesize of output 18 [2023-11-29 05:13:36,462 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 21 treesize of output 16 [2023-11-29 05:13:36,529 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 9 [2023-11-29 05:13:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:13:36,575 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:13:36,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:36,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1823806691] [2023-11-29 05:13:36,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1823806691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:36,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:36,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:13:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220276251] [2023-11-29 05:13:36,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:36,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:13:36,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:13:36,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:13:36,577 INFO L87 Difference]: Start difference. First operand 398 states and 500 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 05:13:43,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:13:47,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:13:48,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:13:48,498 INFO L93 Difference]: Finished difference Result 397 states and 498 transitions. [2023-11-29 05:13:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:13:48,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 38 [2023-11-29 05:13:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:13:48,502 INFO L225 Difference]: With dead ends: 397 [2023-11-29 05:13:48,502 INFO L226 Difference]: Without dead ends: 397 [2023-11-29 05:13:48,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:13:48,503 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 293 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:13:48,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 798 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 523 Invalid, 2 Unknown, 0 Unchecked, 11.8s Time] [2023-11-29 05:13:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-11-29 05:13:48,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2023-11-29 05:13:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 247 states have (on average 1.902834008097166) internal successors, (470), 375 states have internal predecessors, (470), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:13:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 498 transitions. [2023-11-29 05:13:48,513 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 498 transitions. Word has length 38 [2023-11-29 05:13:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:13:48,514 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 498 transitions. [2023-11-29 05:13:48,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 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 05:13:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 498 transitions. [2023-11-29 05:13:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 05:13:48,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:13:48,515 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:13:48,530 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 05:13:48,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:48,716 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:13:48,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:13:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -578102013, now seen corresponding path program 1 times [2023-11-29 05:13:48,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:13:48,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165339155] [2023-11-29 05:13:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:13:48,717 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 05:13:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:13:48,718 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:48,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:13:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:13:49,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 05:13:49,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:13:49,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:13:49,672 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:13:49,673 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 19 treesize of output 27 [2023-11-29 05:13:49,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-29 05:13:50,034 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 47 treesize of output 32 [2023-11-29 05:13:50,472 INFO L349 Elim1Store]: treesize reduction 38, result has 28.3 percent of original size [2023-11-29 05:13:50,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 69 [2023-11-29 05:13:50,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 22 [2023-11-29 05:13:50,700 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 36 treesize of output 15 [2023-11-29 05:13:50,849 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:13:50,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:13:50,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:13:50,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165339155] [2023-11-29 05:13:50,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165339155] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:13:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:13:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 05:13:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130762112] [2023-11-29 05:13:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:13:50,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:13:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:13:50,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:13:50,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:13:50,851 INFO L87 Difference]: Start difference. First operand 397 states and 498 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 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 05:14:03,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:14:07,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:14:11,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:14:15,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:14:19,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:14:23,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:14:27,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 05:14:31,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:14:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:14:34,809 INFO L93 Difference]: Finished difference Result 476 states and 538 transitions. [2023-11-29 05:14:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:14:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 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 41 [2023-11-29 05:14:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:14:34,813 INFO L225 Difference]: With dead ends: 476 [2023-11-29 05:14:34,813 INFO L226 Difference]: Without dead ends: 476 [2023-11-29 05:14:34,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:14:34,814 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 432 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 10 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:14:34,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 1174 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1205 Invalid, 8 Unknown, 0 Unchecked, 43.5s Time] [2023-11-29 05:14:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2023-11-29 05:14:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 406. [2023-11-29 05:14:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 256 states have (on average 1.89453125) internal successors, (485), 384 states have internal predecessors, (485), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:14:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 513 transitions. [2023-11-29 05:14:34,827 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 513 transitions. Word has length 41 [2023-11-29 05:14:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:14:34,827 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 513 transitions. [2023-11-29 05:14:34,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 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 05:14:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 513 transitions. [2023-11-29 05:14:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-11-29 05:14:34,828 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:14:34,829 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:14:34,842 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:35,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:35,030 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:14:35,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:14:35,030 INFO L85 PathProgramCache]: Analyzing trace with hash -578102012, now seen corresponding path program 1 times [2023-11-29 05:14:35,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:14:35,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726215753] [2023-11-29 05:14:35,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:14:35,031 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 05:14:35,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:14:35,032 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:35,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:14:35,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:14:35,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 05:14:35,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:14:35,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:14:36,009 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 05:14:36,063 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:14:36,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 05:14:36,158 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 16 treesize of output 12 [2023-11-29 05:14:36,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 05:14:36,365 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 36 treesize of output 29 [2023-11-29 05:14:36,398 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 21 treesize of output 16 [2023-11-29 05:14:36,671 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:14:36,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:14:36,689 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 39 treesize of output 16 [2023-11-29 05:14:36,894 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 40 treesize of output 13 [2023-11-29 05:14:36,914 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 12 treesize of output 3 [2023-11-29 05:14:36,990 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:14:36,991 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:14:36,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:14:36,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726215753] [2023-11-29 05:14:36,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726215753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:14:36,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:14:36,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 05:14:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893221048] [2023-11-29 05:14:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:14:36,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:14:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:14:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:14:36,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:14:36,994 INFO L87 Difference]: Start difference. First operand 406 states and 513 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 05:14:49,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:14:53,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:14:57,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:15:01,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:15:05,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:15:09,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:15:13,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:15:17,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:15:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:15:21,885 INFO L93 Difference]: Finished difference Result 474 states and 533 transitions. [2023-11-29 05:15:21,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:15:21,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 41 [2023-11-29 05:15:21,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:15:21,889 INFO L225 Difference]: With dead ends: 474 [2023-11-29 05:15:21,889 INFO L226 Difference]: Without dead ends: 474 [2023-11-29 05:15:21,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:15:21,890 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 629 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 1774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:15:21,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 1159 Invalid, 1774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1752 Invalid, 8 Unknown, 0 Unchecked, 44.4s Time] [2023-11-29 05:15:21,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2023-11-29 05:15:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 406. [2023-11-29 05:15:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 256 states have (on average 1.87890625) internal successors, (481), 384 states have internal predecessors, (481), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:15:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 509 transitions. [2023-11-29 05:15:21,899 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 509 transitions. Word has length 41 [2023-11-29 05:15:21,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:15:21,899 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 509 transitions. [2023-11-29 05:15:21,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 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 05:15:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 509 transitions. [2023-11-29 05:15:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 05:15:21,900 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:15:21,900 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:15:21,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:15:22,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:15:22,101 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:15:22,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:15:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash 597844887, now seen corresponding path program 1 times [2023-11-29 05:15:22,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:15:22,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213179905] [2023-11-29 05:15:22,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:15:22,102 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 05:15:22,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:15:22,103 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:15:22,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:15:23,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:23,126 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:15:23,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:15:23,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:15:23,241 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 05:15:23,241 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 19 treesize of output 27 [2023-11-29 05:15:23,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 05:15:23,491 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 38 treesize of output 31 [2023-11-29 05:15:23,733 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:15:23,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-29 05:15:23,988 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:15:23,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 55 [2023-11-29 05:15:24,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2023-11-29 05:15:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2023-11-29 05:15:24,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:15:28,603 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1347) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 05:15:28,646 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 05:15:28,681 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1347 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1346 (Array (_ BitVec 64) (_ BitVec 64)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1347)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 05:15:29,067 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:29,068 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 78 [2023-11-29 05:15:29,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2847 treesize of output 2244 [2023-11-29 05:15:29,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 262 treesize of output 206 [2023-11-29 05:15:29,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 123 treesize of output 81 [2023-11-29 05:15:29,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 164 treesize of output 136 [2023-11-29 05:15:38,175 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification that was a NOOP. DAG size: 485 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-29 05:15:38,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:15:38,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 194 treesize of output 1076 [2023-11-29 05:17:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 100 trivial. 2 not checked. [2023-11-29 05:17:29,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:17:29,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213179905] [2023-11-29 05:17:29,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213179905] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:17:29,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:17:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2023-11-29 05:17:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491682007] [2023-11-29 05:17:29,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:17:29,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:17:29,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:17:29,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:17:29,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=183, Unknown=13, NotChecked=90, Total=342 [2023-11-29 05:17:29,827 INFO L87 Difference]: Start difference. First operand 406 states and 509 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 05:17:43,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:17:47,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:17:51,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:17:55,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:17:59,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:03,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:18:07,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:11,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:15,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:18:19,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:23,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:18:27,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 05:18:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:18:31,491 INFO L93 Difference]: Finished difference Result 472 states and 531 transitions. [2023-11-29 05:18:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:18:31,493 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 44 [2023-11-29 05:18:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:18:31,495 INFO L225 Difference]: With dead ends: 472 [2023-11-29 05:18:31,495 INFO L226 Difference]: Without dead ends: 472 [2023-11-29 05:18:31,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=79, Invalid=226, Unknown=13, NotChecked=102, Total=420 [2023-11-29 05:18:31,496 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 856 mSDsluCounter, 1685 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 28 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 3320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 1346 IncrementalHoareTripleChecker+Unchecked, 61.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:18:31,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 1925 Invalid, 3320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1934 Invalid, 12 Unknown, 1346 Unchecked, 61.2s Time] [2023-11-29 05:18:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-11-29 05:18:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 405. [2023-11-29 05:18:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 256 states have (on average 1.87109375) internal successors, (479), 383 states have internal predecessors, (479), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:18:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 507 transitions. [2023-11-29 05:18:31,507 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 507 transitions. Word has length 44 [2023-11-29 05:18:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:18:31,507 INFO L495 AbstractCegarLoop]: Abstraction has 405 states and 507 transitions. [2023-11-29 05:18:31,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 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 05:18:31,507 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 507 transitions. [2023-11-29 05:18:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-29 05:18:31,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:18:31,508 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:18:31,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:18:31,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:18:31,708 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:18:31,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:18:31,709 INFO L85 PathProgramCache]: Analyzing trace with hash 597844888, now seen corresponding path program 1 times [2023-11-29 05:18:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:18:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604305921] [2023-11-29 05:18:31,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:18:31,710 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 05:18:31,710 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:18:31,711 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:18:31,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:18:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:18:32,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 05:18:32,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:18:32,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:18:32,586 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:18:32,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 05:18:32,601 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 05:18:32,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 05:18:32,710 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 16 treesize of output 12 [2023-11-29 05:18:32,866 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 36 treesize of output 29 [2023-11-29 05:18:32,898 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 21 treesize of output 16 [2023-11-29 05:18:33,112 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:18:33,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:18:33,125 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 39 treesize of output 16 [2023-11-29 05:18:33,455 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:18:33,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:18:33,467 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 39 treesize of output 16 [2023-11-29 05:18:33,648 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 40 treesize of output 13 [2023-11-29 05:18:33,661 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 12 treesize of output 3 [2023-11-29 05:18:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:18:33,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:18:34,554 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) (_ bv1 64) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd .cse2 (_ bv1 64) .cse1)))))) is different from false [2023-11-29 05:18:34,670 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))) (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse3) (bvadd (_ bv1 64) .cse0 .cse3))))))) is different from false [2023-11-29 05:18:34,863 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv1 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1476) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1476))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1475) .cse3 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 05:18:35,006 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1476))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1475) .cse2 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))) (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1475) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1476) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse5) (bvadd .cse0 (_ bv1 64) .cse5))))))) is different from false [2023-11-29 05:18:35,175 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1473 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1474 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1473))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1474) .cse2 v_ArrVal_1475) (select (select (store .cse3 .cse2 v_ArrVal_1476) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1477))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1477 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1476 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1478 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1473 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1475 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1474 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1473))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_1476))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1474) .cse5 v_ArrVal_1475) .cse6 v_ArrVal_1477) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_1478) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))))))))) is different from false [2023-11-29 05:18:35,278 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:18:35,278 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 228 [2023-11-29 05:18:35,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:18:35,319 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 214 treesize of output 137 [2023-11-29 05:18:35,339 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 82435 treesize of output 69232 [2023-11-29 05:18:35,806 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 73236 treesize of output 70743 [2023-11-29 05:18:36,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8822 treesize of output 8192 [2023-11-29 05:18:36,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8192 treesize of output 7765 [2023-11-29 05:18:36,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7765 treesize of output 6197 [2023-11-29 05:18:36,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6197 treesize of output 5770 [2023-11-29 05:18:36,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5770 treesize of output 4811 [2023-11-29 05:18:36,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 4811 treesize of output 4608 [2023-11-29 05:22:01,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:01,618 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2023-11-29 05:22:01,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:22:01,659 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2023-11-29 05:22:01,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 1481 treesize of output 1238 [2023-11-29 05:22:01,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2072 treesize of output 1919 [2023-11-29 05:22:01,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 987 treesize of output 875 [2023-11-29 05:22:01,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 875 treesize of output 707 [2023-11-29 05:22:01,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 707 treesize of output 651 [2023-11-29 05:22:01,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 651 treesize of output 595 [2023-11-29 05:22:01,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 595 treesize of output 511 [2023-11-29 05:22:02,466 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 05:22:02,466 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 15 treesize of output 14 [2023-11-29 05:22:02,471 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 3 not checked. [2023-11-29 05:22:02,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:22:02,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604305921] [2023-11-29 05:22:02,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604305921] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:22:02,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:22:02,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-11-29 05:22:02,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930798787] [2023-11-29 05:22:02,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:22:02,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 05:22:02,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:22:02,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 05:22:02,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=200, Unknown=5, NotChecked=160, Total=420 [2023-11-29 05:22:02,473 INFO L87 Difference]: Start difference. First operand 405 states and 507 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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 05:22:24,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:28,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:32,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:36,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:40,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:44,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:48,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:52,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:22:56,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:23:00,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:23:04,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:23:08,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:23:12,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:23:16,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:23:24,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:23:24,086 INFO L93 Difference]: Finished difference Result 480 states and 538 transitions. [2023-11-29 05:23:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 05:23:24,088 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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 44 [2023-11-29 05:23:24,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:23:24,090 INFO L225 Difference]: With dead ends: 480 [2023-11-29 05:23:24,090 INFO L226 Difference]: Without dead ends: 480 [2023-11-29 05:23:24,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=124, Invalid=397, Unknown=5, NotChecked=230, Total=756 [2023-11-29 05:23:24,091 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 697 mSDsluCounter, 1717 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 28 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 1957 SdHoareTripleChecker+Invalid, 5118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 2243 IncrementalHoareTripleChecker+Unchecked, 79.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:23:24,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 1957 Invalid, 5118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2833 Invalid, 14 Unknown, 2243 Unchecked, 79.8s Time] [2023-11-29 05:23:24,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2023-11-29 05:23:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 411. [2023-11-29 05:23:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 262 states have (on average 1.8549618320610688) internal successors, (486), 389 states have internal predecessors, (486), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:23:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 514 transitions. [2023-11-29 05:23:24,098 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 514 transitions. Word has length 44 [2023-11-29 05:23:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:23:24,098 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 514 transitions. [2023-11-29 05:23:24,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 21 states have internal predecessors, (37), 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 05:23:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 514 transitions. [2023-11-29 05:23:24,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 05:23:24,099 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:23:24,099 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:23:24,112 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:23:24,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:23:24,299 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:23:24,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:23:24,300 INFO L85 PathProgramCache]: Analyzing trace with hash -816290684, now seen corresponding path program 2 times [2023-11-29 05:23:24,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:23:24,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [181696157] [2023-11-29 05:23:24,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:23:24,300 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 05:23:24,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:23:24,301 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:23:24,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:23:25,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 05:23:25,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:23:25,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 05:23:25,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:23:25,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:23:25,936 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 05:23:25,973 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:23:25,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 05:23:26,064 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 16 treesize of output 12 [2023-11-29 05:23:26,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 05:23:26,252 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 36 treesize of output 29 [2023-11-29 05:23:26,259 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 21 treesize of output 16 [2023-11-29 05:23:26,528 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:23:26,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:23:26,542 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 39 treesize of output 16 [2023-11-29 05:23:26,897 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:23:26,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:23:26,926 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 39 treesize of output 16 [2023-11-29 05:23:27,302 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:23:27,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:23:27,331 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 39 treesize of output 16 [2023-11-29 05:23:27,515 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 40 treesize of output 13 [2023-11-29 05:23:27,528 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 12 treesize of output 3 [2023-11-29 05:23:27,610 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-29 05:23:27,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:23:28,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) .cse1) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (bvule (bvadd .cse2 .cse1) (bvadd (_ bv1 64) .cse2 .cse1)))))) is different from false [2023-11-29 05:23:28,648 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse2 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))) (forall ((v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd .cse3 .cse2) (bvadd .cse3 (_ bv1 64) .cse2))))))) is different from false [2023-11-29 05:23:28,834 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1615) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1614) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1614))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem183#1.base| v_ArrVal_1615) .cse3 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) .cse1 (_ bv1 64)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) is different from false [2023-11-29 05:23:29,686 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1615) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1614) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1614))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1615) .cse4 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))))))))) is different from false [2023-11-29 05:23:30,448 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ sign_extend 32) (_ bv2 32))) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1613))) (let ((.cse0 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse4 (store .cse5 .cse0 v_ArrVal_1614))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1612) .cse0 v_ArrVal_1615) .cse1 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) .cse3) (select |c_#length| (select (select (store .cse4 .cse1 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1613))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1612) .cse7 v_ArrVal_1615) (select (select (store .cse8 .cse7 v_ArrVal_1614) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1616))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd .cse6 .cse3) (bvadd .cse6 (_ bv1 64) .cse3)))))) is different from false [2023-11-29 05:23:34,701 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (_ bv2 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1613))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse1 v_ArrVal_1614))) (let ((.cse2 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1612) .cse1 v_ArrVal_1615) .cse2 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) .cse4) (select |c_#length| (select (select (store .cse5 .cse2 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1613))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1612) .cse8 v_ArrVal_1615) (select (select (store .cse9 .cse8 v_ArrVal_1614) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1616))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd .cse7 .cse4) (bvadd .cse7 (_ bv1 64) .cse4))))))) is different from false [2023-11-29 05:23:38,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1611 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1610))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1613))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1611) .cse2 v_ArrVal_1612) .cse3 v_ArrVal_1615) (select (select (store .cse4 .cse3 v_ArrVal_1614) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1616))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1613 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1612 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1615 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1614 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1611 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1610 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1617 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1616 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1610))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_1613))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_1614))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1611) .cse7 v_ArrVal_1612) .cse8 v_ArrVal_1615) .cse9 v_ArrVal_1616) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) (_ bv1 64) .cse1) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_1617) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))))))))))) is different from false [2023-11-29 05:23:39,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:23:39,159 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 451 treesize of output 452 [2023-11-29 05:23:39,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:23:39,198 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 438 treesize of output 257 [2023-11-29 05:23:39,243 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 870799 treesize of output 710698 [2023-11-29 05:23:39,662 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 54079 treesize of output 53368 [2023-11-29 05:23:39,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 536 treesize of output 508 [2023-11-29 05:23:39,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 508 treesize of output 410 [2023-11-29 05:23:39,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 410 treesize of output 368 [2023-11-29 05:23:39,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 368 treesize of output 354 [2023-11-29 05:23:39,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 354 treesize of output 270 [2023-11-29 05:23:39,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 270 treesize of output 256 [2023-11-29 05:23:39,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 141 treesize of output 120 [2023-11-29 05:23:39,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 120 treesize of output 113 [2023-11-29 05:23:42,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:23:42,880 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2023-11-29 05:23:42,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:23:42,939 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 258 [2023-11-29 05:23:42,980 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 33327 treesize of output 27792 [2023-11-29 05:23:43,111 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 61956 treesize of output 60291 [2023-11-29 05:23:43,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2151 treesize of output 1983 [2023-11-29 05:23:43,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1983 treesize of output 1703 [2023-11-29 05:23:43,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1703 treesize of output 1591 [2023-11-29 05:23:43,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1591 treesize of output 1451 [2023-11-29 05:23:43,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1451 treesize of output 1171 [2023-11-29 05:23:43,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1171 treesize of output 1059 [2023-11-29 05:23:43,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1059 treesize of output 1003 [2023-11-29 05:23:49,282 INFO L349 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-11-29 05:23:49,282 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 15 treesize of output 14 [2023-11-29 05:23:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 9 not checked. [2023-11-29 05:23:49,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:23:49,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [181696157] [2023-11-29 05:23:49,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [181696157] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:23:49,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:23:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2023-11-29 05:23:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270559741] [2023-11-29 05:23:49,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 05:23:49,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 05:23:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:23:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:23:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=329, Unknown=7, NotChecked=294, Total=702 [2023-11-29 05:23:49,290 INFO L87 Difference]: Start difference. First operand 411 states and 514 transitions. Second operand has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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 05:24:14,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:18,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:22,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:26,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:30,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:34,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:38,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:42,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:46,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:51,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:55,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:24:59,205 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:03,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:07,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:11,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:15,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:19,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:23,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 05:25:31,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:25:31,198 INFO L93 Difference]: Finished difference Result 487 states and 545 transitions. [2023-11-29 05:25:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:25:31,201 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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 47 [2023-11-29 05:25:31,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:25:31,203 INFO L225 Difference]: With dead ends: 487 [2023-11-29 05:25:31,203 INFO L226 Difference]: Without dead ends: 487 [2023-11-29 05:25:31,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=164, Invalid=669, Unknown=7, NotChecked=420, Total=1260 [2023-11-29 05:25:31,204 INFO L413 NwaCegarLoop]: 239 mSDtfsCounter, 450 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 13 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 96.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1682 SdHoareTripleChecker+Invalid, 5050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 3196 IncrementalHoareTripleChecker+Unchecked, 98.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:25:31,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1682 Invalid, 5050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1823 Invalid, 18 Unknown, 3196 Unchecked, 98.2s Time] [2023-11-29 05:25:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2023-11-29 05:25:31,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 417. [2023-11-29 05:25:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 268 states have (on average 1.8395522388059702) internal successors, (493), 395 states have internal predecessors, (493), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 05:25:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 521 transitions. [2023-11-29 05:25:31,214 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 521 transitions. Word has length 47 [2023-11-29 05:25:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:25:31,214 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 521 transitions. [2023-11-29 05:25:31,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 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 05:25:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 521 transitions. [2023-11-29 05:25:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:25:31,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:25:31,215 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:25:31,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-29 05:25:31,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:25:31,415 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [#Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 144 more)] === [2023-11-29 05:25:31,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:25:31,416 INFO L85 PathProgramCache]: Analyzing trace with hash 5090328, now seen corresponding path program 3 times [2023-11-29 05:25:31,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:25:31,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339951615] [2023-11-29 05:25:31,417 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:25:31,417 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 05:25:31,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:25:31,418 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:25:31,419 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f955460-aa17-4bf2-a023-2517a4497a54/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 05:25:33,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 05:25:33,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:25:33,669 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:25:33,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:25:33,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-29 05:25:33,847 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 05:25:33,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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 05:25:33,878 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 05:25:34,052 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 16 treesize of output 12 [2023-11-29 05:25:34,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 1 [2023-11-29 05:25:34,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-29 05:25:34,394 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 21 treesize of output 16 [2023-11-29 05:25:34,882 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:25:34,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:25:34,926 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 39 treesize of output 16 [2023-11-29 05:25:35,623 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:25:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:25:35,666 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 39 treesize of output 16 [2023-11-29 05:25:36,450 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:25:36,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:25:36,473 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 39 treesize of output 16 [2023-11-29 05:25:37,251 INFO L349 Elim1Store]: treesize reduction 24, result has 17.2 percent of original size [2023-11-29 05:25:37,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 75 [2023-11-29 05:25:37,292 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 39 treesize of output 16 [2023-11-29 05:25:37,684 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 40 treesize of output 13 [2023-11-29 05:25:37,711 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 12 treesize of output 3 [2023-11-29 05:25:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-11-29 05:25:37,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:26:14,339 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ sign_extend 32) (_ bv3 32))) (.cse1 ((_ sign_extend 32) (_ bv2 32))) (.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1757))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse8 (store .cse11 .cse10 v_ArrVal_1760))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1758) .cse10 v_ArrVal_1759) .cse9 v_ArrVal_1762))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse2 (bvadd .cse0 (_ bv1 64) .cse1))) (or (not (bvule (bvadd .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (store .cse8 .cse9 v_ArrVal_1761))) (let ((.cse3 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store .cse4 .cse3 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) .cse6 (_ bv1 64)) (select |c_#length| (select (select (store .cse7 .cse3 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))))))))))))))))) (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1757))) (let ((.cse19 (select (select .cse20 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse16 (store .cse20 .cse19 v_ArrVal_1760))) (let ((.cse17 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse15 (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem181#1.base| v_ArrVal_1758) .cse19 v_ArrVal_1759) .cse17 v_ArrVal_1762))) (let ((.cse18 (select (select .cse15 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse12 (bvadd .cse18 (_ bv1 64) .cse1))) (or (forall ((v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (select (select (store .cse16 .cse17 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (or (not (bvule .cse12 (select |c_#length| .cse13))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse14 (select (select (store .cse15 .cse13 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (bvule (bvadd .cse14 .cse6) (bvadd .cse14 .cse6 (_ bv1 64)))))))) (not (bvule (bvadd .cse18 .cse1) .cse12))))))))))))) is different from false [2023-11-29 05:26:18,879 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 ((_ sign_extend 32) (_ bv3 32))) (.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse10 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (and (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1757))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_1760))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1758) .cse11 v_ArrVal_1759) .cse9 v_ArrVal_1762))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse2 (bvadd (_ bv1 64) .cse0 .cse1))) (or (not (bvule (bvadd .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store .cse8 .cse9 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse2 (select |c_#length| .cse3))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (select (select (store .cse6 .cse3 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 (_ bv1 64) .cse5)))))))))))))))) (forall ((v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_1757))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse18 (store .cse21 .cse20 v_ArrVal_1760))) (let ((.cse19 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse16 (store (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_1758) .cse20 v_ArrVal_1759) .cse19 v_ArrVal_1762))) (let ((.cse13 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse14 (bvadd (_ bv1 64) .cse0 .cse13))) (or (not (bvule (bvadd .cse0 .cse13) .cse14)) (forall ((v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse17 (store .cse18 .cse19 v_ArrVal_1761))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (not (bvule .cse14 (select |c_#length| .cse15))) (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd .cse4 (_ bv1 64) (select (select (store .cse16 .cse15 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)) (select |c_#length| (select (select (store .cse17 .cse15 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))))))))))))))))))) is different from false [2023-11-29 05:26:23,417 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ sign_extend 32) (_ bv3 32))) (.cse0 ((_ sign_extend 32) (_ bv2 32))) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1755))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_1757))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse12 .cse11 v_ArrVal_1760))) (let ((.cse9 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse5 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1756) .cse10 v_ArrVal_1758) .cse11 v_ArrVal_1759) .cse9 v_ArrVal_1762))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse2 (bvadd (_ bv1 64) .cse0 .cse1))) (or (not (bvule (bvadd .cse0 .cse1) .cse2)) (forall ((v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (select (select (store .cse8 .cse9 v_ArrVal_1761) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (select (select (store .cse5 .cse6 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 .cse4 (_ bv1 64))))) (not (bvule .cse2 (select |c_#length| .cse6))))))))))))))))) (forall ((v_ArrVal_1756 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1755 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1758 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1757 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1762 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1760 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1759 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1755))) (let ((.cse21 (select (select .cse24 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse23 (store .cse24 .cse21 v_ArrVal_1757))) (let ((.cse22 (select (select .cse23 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse19 (store .cse23 .cse22 v_ArrVal_1760))) (let ((.cse20 (select (select .cse19 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse16 (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1756) .cse21 v_ArrVal_1758) .cse22 v_ArrVal_1759) .cse20 v_ArrVal_1762))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse15 (bvadd (_ bv1 64) .cse0 .cse14))) (or (not (bvule (bvadd .cse0 .cse14) .cse15)) (forall ((v_ArrVal_1761 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse18 (store .cse19 .cse20 v_ArrVal_1761))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (or (forall ((v_ArrVal_1763 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1764 (Array (_ BitVec 64) (_ BitVec 64)))) (bvule (bvadd (select (select (store .cse16 .cse17 v_ArrVal_1763) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) .cse4 (_ bv1 64)) (select |c_#length| (select (select (store .cse18 .cse17 v_ArrVal_1764) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7)))) (not (bvule .cse15 (select |c_#length| .cse17)))))))))))))))))))) is different from false [2023-11-29 05:26:23,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:26:23,900 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1806 treesize of output 1754 [2023-11-29 05:26:23,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 05:26:23,994 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1741 treesize of output 987 [2023-11-29 05:26:24,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 17234497 treesize of output 14623606 [2023-11-29 05:26:41,366 WARN L293 SmtUtils]: Spent 17.28s on a formula simplification. DAG size of input: 2656 DAG size of output: 619 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 05:26:41,968 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 25372170 treesize of output 24968529 [2023-11-29 05:26:46,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 53617 treesize of output 48213 [2023-11-29 05:26:46,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 46688 treesize of output 43566 [2023-11-29 05:26:47,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29642 treesize of output 25022 [2023-11-29 05:26:48,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 40471 treesize of output 36551