./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/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_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:40:40,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:40:40,124 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:40:40,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:40:40,128 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:40:40,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:40:40,151 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:40:40,151 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:40:40,152 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:40:40,153 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:40:40,153 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:40:40,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:40:40,155 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:40:40,155 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:40:40,156 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:40:40,156 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:40:40,157 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:40:40,157 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:40:40,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:40:40,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:40:40,158 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:40:40,159 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:40:40,159 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:40:40,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:40:40,160 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:40:40,161 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:40:40,161 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:40:40,162 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:40:40,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:40:40,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:40:40,163 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:40:40,163 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:40:40,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:40:40,164 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:40:40,164 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:40:40,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:40:40,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:40:40,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:40:40,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:40:40,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:40:40,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:40:40,165 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_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/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_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 [2023-11-29 04:40:40,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:40:40,377 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:40:40,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:40:40,380 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:40:40,380 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:40:40,381 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2023-11-29 04:40:43,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:40:43,413 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:40:43,414 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2023-11-29 04:40:43,431 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data/4a3faf200/1cb3c698a4834793b7723af9bf8bf70b/FLAG6d4abb8d3 [2023-11-29 04:40:43,445 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data/4a3faf200/1cb3c698a4834793b7723af9bf8bf70b [2023-11-29 04:40:43,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:40:43,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:40:43,450 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:40:43,450 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:40:43,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:40:43,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:40:43" (1/1) ... [2023-11-29 04:40:43,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a32d78a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:43, skipping insertion in model container [2023-11-29 04:40:43,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:40:43" (1/1) ... [2023-11-29 04:40:43,522 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:40:43,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:40:43,963 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 04:40:43,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1afcf2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:43, skipping insertion in model container [2023-11-29 04:40:43,964 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:40:43,964 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:40:43,966 INFO L158 Benchmark]: Toolchain (without parser) took 515.98ms. Allocated memory is still 153.1MB. Free memory was 121.8MB in the beginning and 102.3MB in the end (delta: 19.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:40:43,966 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:40:43,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.80ms. Allocated memory is still 153.1MB. Free memory was 121.5MB in the beginning and 102.3MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:40:43,968 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.14ms. Allocated memory is still 111.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.80ms. Allocated memory is still 153.1MB. Free memory was 121.5MB in the beginning and 102.3MB in the end (delta: 19.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/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_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:40:45,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:40:45,742 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:40:45,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:40:45,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:40:45,776 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:40:45,776 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:40:45,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:40:45,778 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:40:45,778 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:40:45,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:40:45,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:40:45,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:40:45,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:40:45,781 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:40:45,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:40:45,782 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:40:45,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:40:45,783 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:40:45,784 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:40:45,784 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:40:45,785 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:40:45,786 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:40:45,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:40:45,786 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:40:45,787 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:40:45,787 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:40:45,788 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:40:45,788 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:40:45,789 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:40:45,789 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:40:45,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:40:45,790 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:40:45,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:40:45,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:40:45,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:40:45,792 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:40:45,792 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:40:45,793 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:40:45,793 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:40:45,793 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:40:45,793 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:40:45,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:40:45,794 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:40:45,794 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_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/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_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23c0dee81707c82be8d9645ea65556f17c2a25b7864c310b805b07f657c0bc23 [2023-11-29 04:40:46,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:40:46,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:40:46,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:40:46,089 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:40:46,089 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:40:46,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2023-11-29 04:40:48,864 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:40:49,163 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:40:49,164 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test7-1.i [2023-11-29 04:40:49,180 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data/a34bff49e/e1921c12c38d4e7f91a2623c48f543e3/FLAG4e9086337 [2023-11-29 04:40:49,193 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/data/a34bff49e/e1921c12c38d4e7f91a2623c48f543e3 [2023-11-29 04:40:49,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:40:49,197 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:40:49,198 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:40:49,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:40:49,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:40:49,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:49,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a956faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49, skipping insertion in model container [2023-11-29 04:40:49,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:49,262 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:40:49,717 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:40:49,731 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:40:49,742 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:40:49,820 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:40:49,825 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:40:49,908 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:40:49,948 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:40:49,953 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:40:49,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49 WrapperNode [2023-11-29 04:40:49,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:40:49,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:40:49,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:40:49,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:40:49,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:49,989 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,045 INFO L138 Inliner]: procedures = 179, calls = 280, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1017 [2023-11-29 04:40:50,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:40:50,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:40:50,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:40:50,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:40:50,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,159 INFO L175 MemorySlicer]: Split 258 memory accesses to 4 slices as follows [2, 5, 34, 217]. 84 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 1, 4, 50]. [2023-11-29 04:40:50,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,160 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:40:50,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:40:50,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:40:50,233 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:40:50,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (1/1) ... [2023-11-29 04:40:50,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:40:50,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:40:50,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:40:50,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:40:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 04:40:50,296 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 04:40:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:40:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:40:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:40:50,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:40:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:40:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:40:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:40:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:40:50,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 04:40:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 04:40:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 04:40:50,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 04:40:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 04:40:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 04:40:50,298 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 04:40:50,299 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 04:40:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:40:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:40:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:40:50,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:40:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:40:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:40:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:40:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 04:40:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:40:50,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:40:50,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:40:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:40:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:40:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:40:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:40:50,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:40:50,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:40:50,510 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:40:50,512 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:40:50,543 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:40:50,576 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:40:50,597 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:40:50,618 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 04:40:54,662 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:40:54,830 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:40:54,830 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 04:40:54,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:40:54 BoogieIcfgContainer [2023-11-29 04:40:54,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:40:54,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:40:54,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:40:54,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:40:54,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:40:49" (1/3) ... [2023-11-29 04:40:54,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545a91b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:40:54, skipping insertion in model container [2023-11-29 04:40:54,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:40:49" (2/3) ... [2023-11-29 04:40:54,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545a91b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:40:54, skipping insertion in model container [2023-11-29 04:40:54,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:40:54" (3/3) ... [2023-11-29 04:40:54,839 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test7-1.i [2023-11-29 04:40:54,857 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:40:54,857 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2023-11-29 04:40:54,936 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:40:54,941 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;@3ac5bdd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:40:54,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2023-11-29 04:40:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 956 states, 422 states have (on average 2.537914691943128) internal successors, (1071), 949 states have internal predecessors, (1071), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:40:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:40:54,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:40:54,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:40:54,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:40:54,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash 54702, now seen corresponding path program 1 times [2023-11-29 04:40:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:40:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509983801] [2023-11-29 04:40:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:54,970 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:40:54,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:40:54,988 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:40:54,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:40:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:55,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:40:55,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:40:55,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:40:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:55,231 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:40:55,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:40:55,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509983801] [2023-11-29 04:40:55,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [509983801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:55,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:55,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:55,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953965584] [2023-11-29 04:40:55,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:55,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:40:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:55,272 INFO L87 Difference]: Start difference. First operand has 956 states, 422 states have (on average 2.537914691943128) internal successors, (1071), 949 states have internal predecessors, (1071), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:40:57,034 INFO L93 Difference]: Finished difference Result 950 states and 1005 transitions. [2023-11-29 04:40:57,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:40:57,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 04:40:57,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:40:57,051 INFO L225 Difference]: With dead ends: 950 [2023-11-29 04:40:57,051 INFO L226 Difference]: Without dead ends: 949 [2023-11-29 04:40:57,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:57,055 INFO L413 NwaCegarLoop]: 514 mSDtfsCounter, 881 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:40:57,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 561 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 04:40:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2023-11-29 04:40:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 940. [2023-11-29 04:40:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 424 states have (on average 2.330188679245283) internal successors, (988), 934 states have internal predecessors, (988), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:40:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 996 transitions. [2023-11-29 04:40:57,126 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 996 transitions. Word has length 2 [2023-11-29 04:40:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:40:57,127 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 996 transitions. [2023-11-29 04:40:57,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:40:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 996 transitions. [2023-11-29 04:40:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:40:57,127 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:40:57,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:40:57,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:40:57,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:40:57,330 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:40:57,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:40:57,330 INFO L85 PathProgramCache]: Analyzing trace with hash 54703, now seen corresponding path program 1 times [2023-11-29 04:40:57,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:40:57,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133787419] [2023-11-29 04:40:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:40:57,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:40:57,331 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:40:57,332 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:40:57,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:40:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:40:57,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:40:57,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:40:57,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:40:57,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:40:57,461 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:40:57,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:40:57,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133787419] [2023-11-29 04:40:57,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133787419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:40:57,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:40:57,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:40:57,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691439527] [2023-11-29 04:40:57,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:40:57,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:40:57,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:40:57,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:40:57,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:40:57,465 INFO L87 Difference]: Start difference. First operand 940 states and 996 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:00,401 INFO L93 Difference]: Finished difference Result 1296 states and 1383 transitions. [2023-11-29 04:41:00,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:41:00,401 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 04:41:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:00,408 INFO L225 Difference]: With dead ends: 1296 [2023-11-29 04:41:00,408 INFO L226 Difference]: Without dead ends: 1296 [2023-11-29 04:41:00,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:00,409 INFO L413 NwaCegarLoop]: 738 mSDtfsCounter, 385 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:00,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 1208 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 04:41:00,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2023-11-29 04:41:00,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1109. [2023-11-29 04:41:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1109 states, 594 states have (on average 2.3047138047138045) internal successors, (1369), 1103 states have internal predecessors, (1369), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1109 states to 1109 states and 1377 transitions. [2023-11-29 04:41:00,435 INFO L78 Accepts]: Start accepts. Automaton has 1109 states and 1377 transitions. Word has length 2 [2023-11-29 04:41:00,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:00,435 INFO L495 AbstractCegarLoop]: Abstraction has 1109 states and 1377 transitions. [2023-11-29 04:41:00,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1109 states and 1377 transitions. [2023-11-29 04:41:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:41:00,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:00,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 04:41:00,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 04:41:00,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:00,636 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:00,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1020415880, now seen corresponding path program 1 times [2023-11-29 04:41:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:00,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [347910066] [2023-11-29 04:41:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:00,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:00,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:00,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:41:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:00,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:41:00,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:00,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:41:00,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:41:00,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:41:00,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:41:00,891 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:41:00,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:41:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:00,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:00,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:00,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [347910066] [2023-11-29 04:41:00,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [347910066] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:00,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:00,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:41:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902498578] [2023-11-29 04:41:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:00,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:00,915 INFO L87 Difference]: Start difference. First operand 1109 states and 1377 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:03,506 INFO L93 Difference]: Finished difference Result 1112 states and 1382 transitions. [2023-11-29 04:41:03,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:03,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 04:41:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:03,512 INFO L225 Difference]: With dead ends: 1112 [2023-11-29 04:41:03,512 INFO L226 Difference]: Without dead ends: 1112 [2023-11-29 04:41:03,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:03,514 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 966 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:03,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 282 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 04:41:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-29 04:41:03,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 929. [2023-11-29 04:41:03,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 424 states have (on average 2.30188679245283) internal successors, (976), 923 states have internal predecessors, (976), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:03,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 984 transitions. [2023-11-29 04:41:03,539 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 984 transitions. Word has length 6 [2023-11-29 04:41:03,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:03,539 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 984 transitions. [2023-11-29 04:41:03,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:03,540 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 984 transitions. [2023-11-29 04:41:03,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:41:03,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:03,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:03,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:41:03,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:03,743 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:03,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:03,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1568121198, now seen corresponding path program 1 times [2023-11-29 04:41:03,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:03,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663803250] [2023-11-29 04:41:03,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:03,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:03,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:03,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:03,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:41:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:03,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:41:03,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:03,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:41:03,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:03,874 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:03,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:03,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663803250] [2023-11-29 04:41:03,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663803250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:03,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:03,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:41:03,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826216195] [2023-11-29 04:41:03,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:03,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:41:03,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:03,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:41:03,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:03,876 INFO L87 Difference]: Start difference. First operand 929 states and 984 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:05,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:05,943 INFO L93 Difference]: Finished difference Result 1225 states and 1310 transitions. [2023-11-29 04:41:05,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:41:05,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:41:05,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:05,950 INFO L225 Difference]: With dead ends: 1225 [2023-11-29 04:41:05,951 INFO L226 Difference]: Without dead ends: 1225 [2023-11-29 04:41:05,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:05,952 INFO L413 NwaCegarLoop]: 761 mSDtfsCounter, 881 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:05,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 971 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:41:05,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2023-11-29 04:41:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 882. [2023-11-29 04:41:05,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 424 states have (on average 2.1910377358490565) internal successors, (929), 876 states have internal predecessors, (929), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 937 transitions. [2023-11-29 04:41:05,975 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 937 transitions. Word has length 7 [2023-11-29 04:41:05,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:05,976 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 937 transitions. [2023-11-29 04:41:05,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 937 transitions. [2023-11-29 04:41:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:41:05,977 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:05,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:05,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:41:06,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:06,179 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:06,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1568121197, now seen corresponding path program 1 times [2023-11-29 04:41:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286328352] [2023-11-29 04:41:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:06,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:06,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:06,181 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:06,182 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:41:06,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:06,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:41:06,282 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:06,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:41:06,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:06,315 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:06,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286328352] [2023-11-29 04:41:06,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286328352] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:06,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:06,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:41:06,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418104116] [2023-11-29 04:41:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:06,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:41:06,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:06,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:41:06,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:06,317 INFO L87 Difference]: Start difference. First operand 882 states and 937 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:09,387 INFO L93 Difference]: Finished difference Result 1295 states and 1383 transitions. [2023-11-29 04:41:09,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:41:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:41:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:09,393 INFO L225 Difference]: With dead ends: 1295 [2023-11-29 04:41:09,393 INFO L226 Difference]: Without dead ends: 1295 [2023-11-29 04:41:09,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:09,394 INFO L413 NwaCegarLoop]: 932 mSDtfsCounter, 613 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:09,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 1272 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 04:41:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2023-11-29 04:41:09,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 895. [2023-11-29 04:41:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 447 states have (on average 2.1834451901565997) internal successors, (976), 889 states have internal predecessors, (976), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 984 transitions. [2023-11-29 04:41:09,415 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 984 transitions. Word has length 7 [2023-11-29 04:41:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:09,416 INFO L495 AbstractCegarLoop]: Abstraction has 895 states and 984 transitions. [2023-11-29 04:41:09,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 984 transitions. [2023-11-29 04:41:09,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:41:09,416 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:09,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:09,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 04:41:09,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:09,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:09,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:09,619 INFO L85 PathProgramCache]: Analyzing trace with hash 4917671, now seen corresponding path program 1 times [2023-11-29 04:41:09,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:09,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35634490] [2023-11-29 04:41:09,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:09,620 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:09,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:09,621 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:09,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:41:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:09,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:41:09,781 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:09,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:41:09,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:41:09,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-11-29 04:41:09,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:41:09,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 62 treesize of output 22 [2023-11-29 04:41:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:09,855 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:09,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:09,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35634490] [2023-11-29 04:41:09,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35634490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:09,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:09,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:41:09,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780750034] [2023-11-29 04:41:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:09,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:09,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:09,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:09,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:09,858 INFO L87 Difference]: Start difference. First operand 895 states and 984 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:11,942 INFO L93 Difference]: Finished difference Result 1779 states and 1958 transitions. [2023-11-29 04:41:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:11,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:41:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:11,949 INFO L225 Difference]: With dead ends: 1779 [2023-11-29 04:41:11,949 INFO L226 Difference]: Without dead ends: 1779 [2023-11-29 04:41:11,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:11,950 INFO L413 NwaCegarLoop]: 797 mSDtfsCounter, 898 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:11,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 2384 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:41:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2023-11-29 04:41:11,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 897. [2023-11-29 04:41:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 449 states have (on average 2.178173719376392) internal successors, (978), 891 states have internal predecessors, (978), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 986 transitions. [2023-11-29 04:41:11,970 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 986 transitions. Word has length 11 [2023-11-29 04:41:11,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:11,971 INFO L495 AbstractCegarLoop]: Abstraction has 897 states and 986 transitions. [2023-11-29 04:41:11,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 986 transitions. [2023-11-29 04:41:11,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:41:11,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:11,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:11,976 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 04:41:12,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:12,172 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:12,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1709168535, now seen corresponding path program 1 times [2023-11-29 04:41:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:12,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2046505886] [2023-11-29 04:41:12,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:12,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:12,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:12,174 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:12,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:41:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:12,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:41:12,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:12,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:12,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:12,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:12,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2046505886] [2023-11-29 04:41:12,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2046505886] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:12,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:12,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:41:12,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820051313] [2023-11-29 04:41:12,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:12,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:41:12,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:12,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:41:12,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:12,327 INFO L87 Difference]: Start difference. First operand 897 states and 986 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:13,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:13,028 INFO L93 Difference]: Finished difference Result 858 states and 946 transitions. [2023-11-29 04:41:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:41:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:41:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:13,033 INFO L225 Difference]: With dead ends: 858 [2023-11-29 04:41:13,033 INFO L226 Difference]: Without dead ends: 858 [2023-11-29 04:41:13,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:13,034 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 70 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:13,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1485 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 04:41:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-11-29 04:41:13,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 858. [2023-11-29 04:41:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 434 states have (on average 2.161290322580645) internal successors, (938), 852 states have internal predecessors, (938), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:13,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 946 transitions. [2023-11-29 04:41:13,046 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 946 transitions. Word has length 15 [2023-11-29 04:41:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:13,046 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 946 transitions. [2023-11-29 04:41:13,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 946 transitions. [2023-11-29 04:41:13,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:41:13,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:13,047 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:13,051 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:41:13,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:13,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:13,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:13,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1833457533, now seen corresponding path program 1 times [2023-11-29 04:41:13,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:13,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674830457] [2023-11-29 04:41:13,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:13,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:13,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:13,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:13,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:41:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:13,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:41:13,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:13,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:13,429 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:13,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:13,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674830457] [2023-11-29 04:41:13,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674830457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:13,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:13,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:41:13,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560020723] [2023-11-29 04:41:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:13,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:13,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:13,431 INFO L87 Difference]: Start difference. First operand 858 states and 946 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:14,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:14,604 INFO L93 Difference]: Finished difference Result 844 states and 925 transitions. [2023-11-29 04:41:14,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:14,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 04:41:14,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:14,611 INFO L225 Difference]: With dead ends: 844 [2023-11-29 04:41:14,611 INFO L226 Difference]: Without dead ends: 844 [2023-11-29 04:41:14,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:14,612 INFO L413 NwaCegarLoop]: 736 mSDtfsCounter, 58 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:14,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2184 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:41:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2023-11-29 04:41:14,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 843. [2023-11-29 04:41:14,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 433 states have (on average 2.115473441108545) internal successors, (916), 837 states have internal predecessors, (916), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:14,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 924 transitions. [2023-11-29 04:41:14,633 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 924 transitions. Word has length 17 [2023-11-29 04:41:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:14,634 INFO L495 AbstractCegarLoop]: Abstraction has 843 states and 924 transitions. [2023-11-29 04:41:14,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 924 transitions. [2023-11-29 04:41:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:41:14,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:14,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:14,640 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:41:14,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:14,836 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:14,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 308594481, now seen corresponding path program 1 times [2023-11-29 04:41:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349088380] [2023-11-29 04:41:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:14,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:14,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:14,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:41:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:15,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:41:15,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:15,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:41:15,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:15,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:15,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:15,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349088380] [2023-11-29 04:41:15,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349088380] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:15,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:15,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:41:15,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305943950] [2023-11-29 04:41:15,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:15,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:15,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:15,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:15,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:15,144 INFO L87 Difference]: Start difference. First operand 843 states and 924 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:18,191 INFO L93 Difference]: Finished difference Result 1182 states and 1293 transitions. [2023-11-29 04:41:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:18,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 04:41:18,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:18,199 INFO L225 Difference]: With dead ends: 1182 [2023-11-29 04:41:18,199 INFO L226 Difference]: Without dead ends: 1182 [2023-11-29 04:41:18,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:18,200 INFO L413 NwaCegarLoop]: 400 mSDtfsCounter, 814 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 817 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:18,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [817 Valid, 956 Invalid, 1141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 04:41:18,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-29 04:41:18,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 839. [2023-11-29 04:41:18,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 433 states have (on average 2.1062355658198615) internal successors, (912), 833 states have internal predecessors, (912), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 920 transitions. [2023-11-29 04:41:18,214 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 920 transitions. Word has length 31 [2023-11-29 04:41:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:18,215 INFO L495 AbstractCegarLoop]: Abstraction has 839 states and 920 transitions. [2023-11-29 04:41:18,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 920 transitions. [2023-11-29 04:41:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:41:18,215 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:18,215 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:18,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 04:41:18,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:18,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:18,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:18,417 INFO L85 PathProgramCache]: Analyzing trace with hash 308594482, now seen corresponding path program 1 times [2023-11-29 04:41:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:18,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130195968] [2023-11-29 04:41:18,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:18,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 04:41:18,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:18,418 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:18,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:41:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:18,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:41:18,592 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:41:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:18,778 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:18,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:18,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130195968] [2023-11-29 04:41:18,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130195968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:18,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:18,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:41:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410389884] [2023-11-29 04:41:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:18,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:18,780 INFO L87 Difference]: Start difference. First operand 839 states and 920 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:22,518 INFO L93 Difference]: Finished difference Result 1235 states and 1315 transitions. [2023-11-29 04:41:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:22,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 04:41:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:22,524 INFO L225 Difference]: With dead ends: 1235 [2023-11-29 04:41:22,524 INFO L226 Difference]: Without dead ends: 1235 [2023-11-29 04:41:22,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:22,525 INFO L413 NwaCegarLoop]: 553 mSDtfsCounter, 548 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:22,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1253 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 04:41:22,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2023-11-29 04:41:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 835. [2023-11-29 04:41:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 433 states have (on average 2.096997690531178) internal successors, (908), 829 states have internal predecessors, (908), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 916 transitions. [2023-11-29 04:41:22,539 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 916 transitions. Word has length 31 [2023-11-29 04:41:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:22,539 INFO L495 AbstractCegarLoop]: Abstraction has 835 states and 916 transitions. [2023-11-29 04:41:22,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 916 transitions. [2023-11-29 04:41:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 04:41:22,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:22,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:22,545 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:41:22,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:22,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:22,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:22,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1210445483, now seen corresponding path program 1 times [2023-11-29 04:41:22,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:22,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440703038] [2023-11-29 04:41:22,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:22,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:22,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:22,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:22,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:41:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:22,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:41:22,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:22,996 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:22,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:22,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440703038] [2023-11-29 04:41:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440703038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:22,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:41:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86278143] [2023-11-29 04:41:22,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:22,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:22,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:22,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:22,997 INFO L87 Difference]: Start difference. First operand 835 states and 916 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:23,906 INFO L93 Difference]: Finished difference Result 829 states and 906 transitions. [2023-11-29 04:41:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:23,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 04:41:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:23,912 INFO L225 Difference]: With dead ends: 829 [2023-11-29 04:41:23,912 INFO L226 Difference]: Without dead ends: 829 [2023-11-29 04:41:23,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:23,913 INFO L413 NwaCegarLoop]: 730 mSDtfsCounter, 23 mSDsluCounter, 1440 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2170 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:23,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2170 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:41:23,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2023-11-29 04:41:23,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 829. [2023-11-29 04:41:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 427 states have (on average 2.1030444964871196) internal successors, (898), 823 states have internal predecessors, (898), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 906 transitions. [2023-11-29 04:41:23,924 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 906 transitions. Word has length 47 [2023-11-29 04:41:23,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:23,924 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 906 transitions. [2023-11-29 04:41:23,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 906 transitions. [2023-11-29 04:41:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 04:41:23,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:23,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:23,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:41:24,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:24,131 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:24,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:24,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1449506260, now seen corresponding path program 1 times [2023-11-29 04:41:24,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:24,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945425475] [2023-11-29 04:41:24,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:24,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:24,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:24,133 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:24,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:41:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:24,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:41:24,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:24,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:24,615 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:24,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:24,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945425475] [2023-11-29 04:41:24,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945425475] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:24,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:24,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:41:24,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199049844] [2023-11-29 04:41:24,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:24,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:41:24,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:24,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:41:24,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:24,617 INFO L87 Difference]: Start difference. First operand 829 states and 906 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:25,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:25,700 INFO L93 Difference]: Finished difference Result 1167 states and 1266 transitions. [2023-11-29 04:41:25,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:41:25,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 04:41:25,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:25,706 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 04:41:25,706 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 04:41:25,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:41:25,707 INFO L413 NwaCegarLoop]: 908 mSDtfsCounter, 368 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1526 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:25,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1526 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 04:41:25,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 04:41:25,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1002. [2023-11-29 04:41:25,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 600 states have (on average 2.045) internal successors, (1227), 996 states have internal predecessors, (1227), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:25,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1235 transitions. [2023-11-29 04:41:25,723 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1235 transitions. Word has length 51 [2023-11-29 04:41:25,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:25,723 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1235 transitions. [2023-11-29 04:41:25,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:25,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1235 transitions. [2023-11-29 04:41:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 04:41:25,725 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:25,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:25,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:41:25,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:25,928 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:25,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash -747226817, now seen corresponding path program 1 times [2023-11-29 04:41:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:25,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299329924] [2023-11-29 04:41:25,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:25,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:25,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:25,931 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:25,931 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:41:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:26,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:41:26,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:26,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:41:26,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:41:26,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:41:26,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:41:26,667 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:41:26,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:41:26,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:26,679 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:26,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:26,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299329924] [2023-11-29 04:41:26,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299329924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:26,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:26,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:41:26,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680465228] [2023-11-29 04:41:26,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:26,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:26,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:26,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:26,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:26,681 INFO L87 Difference]: Start difference. First operand 1002 states and 1235 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:29,527 INFO L93 Difference]: Finished difference Result 1370 states and 1729 transitions. [2023-11-29 04:41:29,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:29,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 04:41:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:29,533 INFO L225 Difference]: With dead ends: 1370 [2023-11-29 04:41:29,533 INFO L226 Difference]: Without dead ends: 1370 [2023-11-29 04:41:29,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:29,534 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 1104 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:29,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 349 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 04:41:29,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2023-11-29 04:41:29,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 941. [2023-11-29 04:41:29,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 577 states have (on average 1.9618717504332757) internal successors, (1132), 935 states have internal predecessors, (1132), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:29,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1140 transitions. [2023-11-29 04:41:29,546 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1140 transitions. Word has length 54 [2023-11-29 04:41:29,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:29,546 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1140 transitions. [2023-11-29 04:41:29,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:29,546 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1140 transitions. [2023-11-29 04:41:29,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:41:29,547 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:29,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:29,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-29 04:41:29,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:29,748 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:29,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:29,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587914, now seen corresponding path program 1 times [2023-11-29 04:41:29,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:29,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488687329] [2023-11-29 04:41:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:29,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:29,750 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:29,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:41:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:29,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:41:30,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:30,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:41:30,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:41:30,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:41:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:30,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:30,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:30,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488687329] [2023-11-29 04:41:30,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488687329] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:41:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133424458] [2023-11-29 04:41:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:30,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:41:30,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:41:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:30,051 INFO L87 Difference]: Start difference. First operand 941 states and 1140 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:32,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:32,647 INFO L93 Difference]: Finished difference Result 940 states and 1139 transitions. [2023-11-29 04:41:32,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:41:32,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 04:41:32,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:32,651 INFO L225 Difference]: With dead ends: 940 [2023-11-29 04:41:32,652 INFO L226 Difference]: Without dead ends: 940 [2023-11-29 04:41:32,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:41:32,653 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 3 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:32,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1817 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 04:41:32,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-29 04:41:32,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2023-11-29 04:41:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 577 states have (on average 1.9601386481802425) internal successors, (1131), 934 states have internal predecessors, (1131), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:32,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1139 transitions. [2023-11-29 04:41:32,665 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1139 transitions. Word has length 58 [2023-11-29 04:41:32,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:32,665 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1139 transitions. [2023-11-29 04:41:32,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1139 transitions. [2023-11-29 04:41:32,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 04:41:32,666 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:32,666 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:32,671 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:41:32,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:32,867 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:32,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1674587913, now seen corresponding path program 1 times [2023-11-29 04:41:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:32,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475332411] [2023-11-29 04:41:32,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:32,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:32,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:32,869 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:32,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:41:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:33,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:41:33,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:33,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:41:33,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:41:33,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:41:33,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 04:41:33,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:33,191 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:33,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:33,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475332411] [2023-11-29 04:41:33,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475332411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:33,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:33,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:41:33,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900733654] [2023-11-29 04:41:33,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:33,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:41:33,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:33,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:41:33,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:33,193 INFO L87 Difference]: Start difference. First operand 940 states and 1139 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:36,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:36,470 INFO L93 Difference]: Finished difference Result 939 states and 1138 transitions. [2023-11-29 04:41:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:41:36,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2023-11-29 04:41:36,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:36,475 INFO L225 Difference]: With dead ends: 939 [2023-11-29 04:41:36,475 INFO L226 Difference]: Without dead ends: 939 [2023-11-29 04:41:36,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:41:36,476 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1858 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:36,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1858 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 04:41:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2023-11-29 04:41:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 939. [2023-11-29 04:41:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 576 states have (on average 1.9618055555555556) internal successors, (1130), 933 states have internal predecessors, (1130), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 04:41:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1138 transitions. [2023-11-29 04:41:36,486 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1138 transitions. Word has length 58 [2023-11-29 04:41:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:36,487 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1138 transitions. [2023-11-29 04:41:36,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:41:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1138 transitions. [2023-11-29 04:41:36,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:41:36,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:36,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:36,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:41:36,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:36,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:36,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash 722574426, now seen corresponding path program 1 times [2023-11-29 04:41:36,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:36,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1579822553] [2023-11-29 04:41:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:36,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:36,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:36,690 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:36,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:41:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:36,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:41:36,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:36,944 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:41:36,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1579822553] [2023-11-29 04:41:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1579822553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:41:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:41:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:41:36,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545102852] [2023-11-29 04:41:36,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:41:36,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:41:36,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:41:36,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:41:36,946 INFO L87 Difference]: Start difference. First operand 939 states and 1138 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:41:37,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:37,801 INFO L93 Difference]: Finished difference Result 941 states and 1141 transitions. [2023-11-29 04:41:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:41:37,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-11-29 04:41:37,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:37,808 INFO L225 Difference]: With dead ends: 941 [2023-11-29 04:41:37,808 INFO L226 Difference]: Without dead ends: 941 [2023-11-29 04:41:37,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:41:37,809 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 1 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:37,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2109 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:41:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2023-11-29 04:41:37,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 941. [2023-11-29 04:41:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 577 states have (on average 1.9618717504332757) internal successors, (1132), 935 states have internal predecessors, (1132), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:41:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1141 transitions. [2023-11-29 04:41:37,820 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1141 transitions. Word has length 64 [2023-11-29 04:41:37,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:37,821 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1141 transitions. [2023-11-29 04:41:37,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:41:37,821 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1141 transitions. [2023-11-29 04:41:37,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 04:41:37,821 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:37,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:37,826 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 04:41:38,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:38,022 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:38,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:38,022 INFO L85 PathProgramCache]: Analyzing trace with hash 467963144, now seen corresponding path program 1 times [2023-11-29 04:41:38,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:38,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608770839] [2023-11-29 04:41:38,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:41:38,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:38,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:38,024 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:38,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 04:41:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:41:38,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:41:38,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:38,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:38,341 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:38,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:38,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608770839] [2023-11-29 04:41:38,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1608770839] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:41:38,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:41:38,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:41:38,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508158643] [2023-11-29 04:41:38,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:41:38,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:41:38,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:38,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:41:38,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:41:38,403 INFO L87 Difference]: Start difference. First operand 941 states and 1141 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:41:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:40,294 INFO L93 Difference]: Finished difference Result 950 states and 1155 transitions. [2023-11-29 04:41:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:41:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-11-29 04:41:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:40,298 INFO L225 Difference]: With dead ends: 950 [2023-11-29 04:41:40,298 INFO L226 Difference]: Without dead ends: 950 [2023-11-29 04:41:40,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:41:40,299 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 6 mSDsluCounter, 3505 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:40,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4208 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 04:41:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2023-11-29 04:41:40,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 949. [2023-11-29 04:41:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 584 states have (on average 1.9606164383561644) internal successors, (1145), 942 states have internal predecessors, (1145), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:41:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1154 transitions. [2023-11-29 04:41:40,311 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1154 transitions. Word has length 65 [2023-11-29 04:41:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:40,311 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1154 transitions. [2023-11-29 04:41:40,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:41:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1154 transitions. [2023-11-29 04:41:40,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 04:41:40,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:40,312 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:40,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 04:41:40,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:40,512 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:40,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:40,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1084184538, now seen corresponding path program 2 times [2023-11-29 04:41:40,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:40,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099959597] [2023-11-29 04:41:40,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:41:40,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:40,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:40,514 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:40,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 04:41:40,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:41:40,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:41:40,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:41:40,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:41,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:41,167 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:41,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:41,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099959597] [2023-11-29 04:41:41,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099959597] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:41:41,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:41:41,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 04:41:41,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366655618] [2023-11-29 04:41:41,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:41:41,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 04:41:41,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:41,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 04:41:41,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 04:41:41,170 INFO L87 Difference]: Start difference. First operand 949 states and 1154 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:41:43,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:43,592 INFO L93 Difference]: Finished difference Result 964 states and 1176 transitions. [2023-11-29 04:41:43,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 04:41:43,593 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2023-11-29 04:41:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:43,597 INFO L225 Difference]: With dead ends: 964 [2023-11-29 04:41:43,597 INFO L226 Difference]: Without dead ends: 962 [2023-11-29 04:41:43,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:41:43,598 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 13 mSDsluCounter, 4210 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4913 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:43,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4913 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 04:41:43,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2023-11-29 04:41:43,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 958. [2023-11-29 04:41:43,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 593 states have (on average 1.951096121416526) internal successors, (1157), 951 states have internal predecessors, (1157), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:41:43,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1166 transitions. [2023-11-29 04:41:43,613 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1166 transitions. Word has length 68 [2023-11-29 04:41:43,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:43,613 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1166 transitions. [2023-11-29 04:41:43,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:41:43,613 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1166 transitions. [2023-11-29 04:41:43,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 04:41:43,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:43,614 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:43,621 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:41:43,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:43,814 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:43,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash -961566438, now seen corresponding path program 3 times [2023-11-29 04:41:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48003275] [2023-11-29 04:41:43,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:41:43,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:43,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:43,816 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:43,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 04:41:44,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 04:41:44,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:41:44,507 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:41:44,509 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:44,615 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:45,203 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:45,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48003275] [2023-11-29 04:41:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48003275] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:41:45,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:41:45,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 04:41:45,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036731625] [2023-11-29 04:41:45,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:41:45,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:41:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:45,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:41:45,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:41:45,206 INFO L87 Difference]: Start difference. First operand 958 states and 1166 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:41:50,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:41:50,351 INFO L93 Difference]: Finished difference Result 988 states and 1216 transitions. [2023-11-29 04:41:50,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 04:41:50,352 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2023-11-29 04:41:50,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:41:50,356 INFO L225 Difference]: With dead ends: 988 [2023-11-29 04:41:50,356 INFO L226 Difference]: Without dead ends: 985 [2023-11-29 04:41:50,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 04:41:50,357 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 25 mSDsluCounter, 7709 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8411 SdHoareTripleChecker+Invalid, 1834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:41:50,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8411 Invalid, 1834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 04:41:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2023-11-29 04:41:50,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 976. [2023-11-29 04:41:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 611 states have (on average 1.9312602291325696) internal successors, (1180), 969 states have internal predecessors, (1180), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:41:50,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1189 transitions. [2023-11-29 04:41:50,372 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1189 transitions. Word has length 74 [2023-11-29 04:41:50,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:41:50,372 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1189 transitions. [2023-11-29 04:41:50,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:41:50,373 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1189 transitions. [2023-11-29 04:41:50,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 04:41:50,373 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:41:50,373 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:41:50,381 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 04:41:50,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:50,574 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:41:50,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:41:50,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1762755686, now seen corresponding path program 4 times [2023-11-29 04:41:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:41:50,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856891407] [2023-11-29 04:41:50,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:41:50,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:41:50,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:41:50,576 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:41:50,577 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 04:41:50,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:41:50,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:41:50,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 04:41:50,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:41:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:51,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:41:52,850 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:41:52,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:41:52,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856891407] [2023-11-29 04:41:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856891407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:41:52,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:41:52,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 04:41:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609480401] [2023-11-29 04:41:52,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:41:52,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 04:41:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:41:52,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 04:41:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 04:41:52,853 INFO L87 Difference]: Start difference. First operand 976 states and 1189 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:42:06,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:42:06,286 INFO L93 Difference]: Finished difference Result 1033 states and 1278 transitions. [2023-11-29 04:42:06,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 04:42:06,287 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2023-11-29 04:42:06,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:42:06,291 INFO L225 Difference]: With dead ends: 1033 [2023-11-29 04:42:06,292 INFO L226 Difference]: Without dead ends: 1031 [2023-11-29 04:42:06,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 04:42:06,295 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 47 mSDsluCounter, 18249 mSDsCounter, 0 mSdLazyCounter, 4909 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 18952 SdHoareTripleChecker+Invalid, 4967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:42:06,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 18952 Invalid, 4967 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 4909 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 04:42:06,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-11-29 04:42:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1010. [2023-11-29 04:42:06,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 645 states have (on average 1.9007751937984496) internal successors, (1226), 1003 states have internal predecessors, (1226), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:42:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1235 transitions. [2023-11-29 04:42:06,311 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1235 transitions. Word has length 86 [2023-11-29 04:42:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:42:06,311 INFO L495 AbstractCegarLoop]: Abstraction has 1010 states and 1235 transitions. [2023-11-29 04:42:06,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:42:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1235 transitions. [2023-11-29 04:42:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:42:06,312 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:42:06,312 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:42:06,318 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 04:42:06,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:42:06,512 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:42:06,513 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:42:06,513 INFO L85 PathProgramCache]: Analyzing trace with hash 917531354, now seen corresponding path program 5 times [2023-11-29 04:42:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:42:06,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1527527918] [2023-11-29 04:42:06,513 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:42:06,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:42:06,514 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:42:06,514 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:42:06,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 04:42:07,817 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:42:07,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:42:07,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 04:42:07,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:42:07,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:42:07,956 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:42:07,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:42:07,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:42:08,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:42:08,925 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:42:08,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:42:08,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:42:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:42:08,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:42:09,386 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2001 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2001) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:42:09,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:42:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1527527918] [2023-11-29 04:42:09,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1527527918] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:42:09,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [458649903] [2023-11-29 04:42:09,388 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:42:09,388 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:42:09,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:42:09,389 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:42:09,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 04:43:11,775 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:43:11,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:43:11,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 04:43:11,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:43:11,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:43:12,196 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:43:12,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:43:12,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:43:12,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:43:13,182 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:43:13,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:43:13,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:43:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:43:13,253 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:43:13,598 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_2464) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:43:13,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [458649903] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:43:13,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:43:13,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 04:43:13,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659546662] [2023-11-29 04:43:13,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:43:13,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:43:13,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:43:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:43:13,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=163, Unknown=2, NotChecked=54, Total=272 [2023-11-29 04:43:13,602 INFO L87 Difference]: Start difference. First operand 1010 states and 1235 transitions. Second operand has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:43:20,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:43:20,141 INFO L93 Difference]: Finished difference Result 1417 states and 1766 transitions. [2023-11-29 04:43:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:43:20,142 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 04:43:20,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:43:20,148 INFO L225 Difference]: With dead ends: 1417 [2023-11-29 04:43:20,148 INFO L226 Difference]: Without dead ends: 1415 [2023-11-29 04:43:20,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=184, Unknown=2, NotChecked=58, Total=306 [2023-11-29 04:43:20,149 INFO L413 NwaCegarLoop]: 391 mSDtfsCounter, 704 mSDsluCounter, 2586 mSDsCounter, 0 mSdLazyCounter, 3395 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 3401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:43:20,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2977 Invalid, 3401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3395 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2023-11-29 04:43:20,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2023-11-29 04:43:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1009. [2023-11-29 04:43:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1009 states, 645 states have (on average 1.8930232558139535) internal successors, (1221), 1002 states have internal predecessors, (1221), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:43:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1009 states to 1009 states and 1230 transitions. [2023-11-29 04:43:20,163 INFO L78 Accepts]: Start accepts. Automaton has 1009 states and 1230 transitions. Word has length 108 [2023-11-29 04:43:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:43:20,163 INFO L495 AbstractCegarLoop]: Abstraction has 1009 states and 1230 transitions. [2023-11-29 04:43:20,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.0) internal successors, (120), 13 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:43:20,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1009 states and 1230 transitions. [2023-11-29 04:43:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 04:43:20,164 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:43:20,164 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:43:20,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 04:43:20,394 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 04:43:20,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:43:20,565 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:43:20,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:43:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 917531355, now seen corresponding path program 1 times [2023-11-29 04:43:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:43:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274631031] [2023-11-29 04:43:20,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:20,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:43:20,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:43:20,567 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:43:20,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 04:43:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:43:21,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 04:43:21,249 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:43:21,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:43:21,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:43:21,482 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:43:21,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:43:21,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:43:21,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:43:21,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:43:21,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:43:22,206 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:43:22,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:43:22,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:43:22,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:43:22,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:43:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:43:22,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:43:23,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3019 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3018 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3018) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:43:23,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:43:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274631031] [2023-11-29 04:43:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274631031] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:43:23,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762471296] [2023-11-29 04:43:23,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:43:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:43:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:43:23,617 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:43:23,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 04:45:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:02,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 04:45:02,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:02,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:45:03,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:45:03,246 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:03,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:45:03,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:03,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:45:03,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:45:03,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:04,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:04,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:04,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:04,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 25 treesize of output 13 [2023-11-29 04:45:04,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:45:04,125 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:45:05,511 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3574 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3573 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3574) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3573) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:45:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [762471296] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:45:05,516 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:45:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 04:45:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716913022] [2023-11-29 04:45:05,516 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:45:05,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:45:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:45:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 04:45:05,517 INFO L87 Difference]: Start difference. First operand 1009 states and 1230 transitions. Second operand has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:45:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:13,875 INFO L93 Difference]: Finished difference Result 1414 states and 1761 transitions. [2023-11-29 04:45:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:45:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 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 108 [2023-11-29 04:45:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:13,882 INFO L225 Difference]: With dead ends: 1414 [2023-11-29 04:45:13,882 INFO L226 Difference]: Without dead ends: 1414 [2023-11-29 04:45:13,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 04:45:13,883 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 660 mSDsluCounter, 1337 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 3544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:13,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1753 Invalid, 3544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 04:45:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2023-11-29 04:45:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1008. [2023-11-29 04:45:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 645 states have (on average 1.8914728682170543) internal successors, (1220), 1001 states have internal predecessors, (1220), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:45:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1229 transitions. [2023-11-29 04:45:13,903 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1229 transitions. Word has length 108 [2023-11-29 04:45:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:13,903 INFO L495 AbstractCegarLoop]: Abstraction has 1008 states and 1229 transitions. [2023-11-29 04:45:13,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.142857142857142) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:45:13,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1229 transitions. [2023-11-29 04:45:13,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:45:13,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:13,905 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:13,943 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 04:45:14,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 04:45:14,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:14,306 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:45:14,306 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:14,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1280662647, now seen corresponding path program 1 times [2023-11-29 04:45:14,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:14,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741515094] [2023-11-29 04:45:14,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:14,307 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:14,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:14,308 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:14,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 04:45:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:15,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 04:45:15,118 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:15,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:45:15,228 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:45:15,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:45:15,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:45:15,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:45:16,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:45:16,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:45:16,322 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:45:16,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:45:16,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:45:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:45:16,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:45:20,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3998 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3998) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 04:45:20,880 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3998 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4044 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4044))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3998)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:45:20,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741515094] [2023-11-29 04:45:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741515094] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:45:20,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1370075888] [2023-11-29 04:45:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:20,884 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:45:20,884 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:45:20,885 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:45:20,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 04:45:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:23,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 04:45:23,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:23,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:45:23,443 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:45:23,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:45:23,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:23,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:45:24,515 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:24,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:45:24,661 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:24,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:45:24,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:45:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:45:24,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:45:24,703 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4468) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:45:24,714 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4468) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:45:25,109 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4468 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4514))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4468)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:45:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1370075888] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:45:25,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:45:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 04:45:25,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660504585] [2023-11-29 04:45:25,112 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:45:25,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 04:45:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:25,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 04:45:25,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=243, Unknown=7, NotChecked=180, Total=506 [2023-11-29 04:45:25,113 INFO L87 Difference]: Start difference. First operand 1008 states and 1229 transitions. Second operand has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:45:34,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:34,460 INFO L93 Difference]: Finished difference Result 1413 states and 1760 transitions. [2023-11-29 04:45:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:45:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 04:45:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:34,469 INFO L225 Difference]: With dead ends: 1413 [2023-11-29 04:45:34,469 INFO L226 Difference]: Without dead ends: 1413 [2023-11-29 04:45:34,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=85, Invalid=270, Unknown=7, NotChecked=190, Total=552 [2023-11-29 04:45:34,470 INFO L413 NwaCegarLoop]: 390 mSDtfsCounter, 699 mSDsluCounter, 2996 mSDsCounter, 0 mSdLazyCounter, 3928 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 3386 SdHoareTripleChecker+Invalid, 3934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:34,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 3386 Invalid, 3934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3928 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2023-11-29 04:45:34,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2023-11-29 04:45:34,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1007. [2023-11-29 04:45:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 645 states have (on average 1.889922480620155) internal successors, (1219), 1000 states have internal predecessors, (1219), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:45:34,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1228 transitions. [2023-11-29 04:45:34,484 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1228 transitions. Word has length 110 [2023-11-29 04:45:34,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:34,484 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1228 transitions. [2023-11-29 04:45:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.333333333333334) internal successors, (124), 15 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:45:34,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1228 transitions. [2023-11-29 04:45:34,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 04:45:34,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:34,486 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:45:34,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 04:45:34,697 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 04:45:34,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:34,886 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:45:34,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:34,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1280662648, now seen corresponding path program 1 times [2023-11-29 04:45:34,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:34,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1349268462] [2023-11-29 04:45:34,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:34,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:34,889 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:34,890 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 04:45:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:35,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 04:45:35,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:35,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:45:35,959 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:45:35,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:45:35,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:45:35,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:45:36,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:45:36,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:45:36,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:36,809 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:36,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:36,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:36,918 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:45:36,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:45:36,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:45:36,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:45:36,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:45:36,978 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:45:36,979 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:45:37,152 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 04:45:37,197 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4985 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4985) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4984) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 04:45:38,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1349268462] [2023-11-29 04:45:38,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1349268462] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:45:38,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [543183753] [2023-11-29 04:45:38,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:38,866 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:45:38,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:45:38,866 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:45:38,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 04:47:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:22,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 04:47:22,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:22,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:47:22,493 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:47:22,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:47:22,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:47:22,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:47:22,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:47:22,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:47:22,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:47:23,267 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:47:23,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:47:23,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:47:23,357 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:47:23,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:47:23,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 24 treesize of output 11 [2023-11-29 04:47:23,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:47:23,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:47:23,396 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:47:23,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:23,454 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:47:23,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 04:47:24,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5547 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5640))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5639) .cse0 v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5547) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5639 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5548 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5639) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5548) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 04:47:24,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [543183753] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:47:24,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:24,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 04:47:24,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864629525] [2023-11-29 04:47:24,873 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:24,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:47:24,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:47:24,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=121, Unknown=14, NotChecked=130, Total=306 [2023-11-29 04:47:24,874 INFO L87 Difference]: Start difference. First operand 1007 states and 1228 transitions. Second operand has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:47:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:37,224 INFO L93 Difference]: Finished difference Result 1412 states and 1759 transitions. [2023-11-29 04:47:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:47:37,226 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 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 110 [2023-11-29 04:47:37,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:37,231 INFO L225 Difference]: With dead ends: 1412 [2023-11-29 04:47:37,231 INFO L226 Difference]: Without dead ends: 1412 [2023-11-29 04:47:37,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=73, Invalid=237, Unknown=16, NotChecked=180, Total=506 [2023-11-29 04:47:37,232 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 658 mSDsluCounter, 1781 mSDsCounter, 0 mSdLazyCounter, 4686 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 2196 SdHoareTripleChecker+Invalid, 4693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 4686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:37,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 2196 Invalid, 4693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 4686 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-11-29 04:47:37,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2023-11-29 04:47:37,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1006. [2023-11-29 04:47:37,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 645 states have (on average 1.8883720930232557) internal successors, (1218), 999 states have internal predecessors, (1218), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:47:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1227 transitions. [2023-11-29 04:47:37,245 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1227 transitions. Word has length 110 [2023-11-29 04:47:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:37,245 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1227 transitions. [2023-11-29 04:47:37,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.25) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:47:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1227 transitions. [2023-11-29 04:47:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:47:37,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:37,246 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:37,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 04:47:37,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 04:47:37,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:37,647 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:47:37,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1937487633, now seen corresponding path program 1 times [2023-11-29 04:47:37,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016759466] [2023-11-29 04:47:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:37,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:37,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:37,649 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:37,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 04:47:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:38,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 04:47:38,631 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:38,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:47:38,774 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:47:38,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:47:38,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:47:38,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:47:39,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:47:39,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:47:40,007 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:47:40,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:47:40,095 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:47:40,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:47:40,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:47:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:47:40,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:44,280 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6080) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:47:44,293 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:47:44,306 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:47:44,700 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6079 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6126))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6079)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:47:44,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016759466] [2023-11-29 04:47:44,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016759466] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:47:44,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2055316264] [2023-11-29 04:47:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:44,704 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:47:44,704 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:47:44,705 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:47:44,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 04:48:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:10,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 04:48:10,405 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:10,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:48:10,729 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:48:10,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:48:10,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:48:10,974 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:48:11,797 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:11,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:48:11,975 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:11,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:48:12,074 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:12,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:48:12,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:48:12,103 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:48:12,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:12,118 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:48:12,130 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6566) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:48:12,145 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:48:12,160 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:48:12,612 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6566 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6612 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6612))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6565)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6566)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:48:12,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2055316264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:12,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:12,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 04:48:12,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798597984] [2023-11-29 04:48:12,616 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:12,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:48:12,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:48:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:48:12,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=307, Unknown=12, NotChecked=396, Total=812 [2023-11-29 04:48:12,617 INFO L87 Difference]: Start difference. First operand 1006 states and 1227 transitions. Second operand has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:48:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:48:22,735 INFO L93 Difference]: Finished difference Result 1411 states and 1758 transitions. [2023-11-29 04:48:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:48:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 112 [2023-11-29 04:48:22,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:48:22,742 INFO L225 Difference]: With dead ends: 1411 [2023-11-29 04:48:22,742 INFO L226 Difference]: Without dead ends: 1411 [2023-11-29 04:48:22,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=106, Invalid=338, Unknown=12, NotChecked=414, Total=870 [2023-11-29 04:48:22,743 INFO L413 NwaCegarLoop]: 389 mSDtfsCounter, 697 mSDsluCounter, 3357 mSDsCounter, 0 mSdLazyCounter, 4376 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 3746 SdHoareTripleChecker+Invalid, 4381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 4376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:48:22,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 3746 Invalid, 4381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 4376 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2023-11-29 04:48:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2023-11-29 04:48:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1005. [2023-11-29 04:48:22,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 645 states have (on average 1.8868217054263565) internal successors, (1217), 998 states have internal predecessors, (1217), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:48:22,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1226 transitions. [2023-11-29 04:48:22,762 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1226 transitions. Word has length 112 [2023-11-29 04:48:22,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:48:22,762 INFO L495 AbstractCegarLoop]: Abstraction has 1005 states and 1226 transitions. [2023-11-29 04:48:22,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.142857142857142) internal successors, (128), 17 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:48:22,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1226 transitions. [2023-11-29 04:48:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 04:48:22,763 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:48:22,763 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:48:22,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 04:48:22,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 04:48:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:48:23,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:48:23,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:48:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1937487632, now seen corresponding path program 1 times [2023-11-29 04:48:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:48:23,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1646408589] [2023-11-29 04:48:23,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:23,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:48:23,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:48:23,165 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:48:23,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 04:48:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:24,088 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 04:48:24,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:48:24,348 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:48:24,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:48:24,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:48:24,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:24,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:48:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:48:24,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:48:25,116 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:25,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:48:25,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 24 treesize of output 11 [2023-11-29 04:48:25,228 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:25,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:48:25,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:48:25,310 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:25,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:48:25,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:48:25,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:48:25,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:48:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:48:25,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:25,521 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 04:48:25,551 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 04:48:25,625 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7098))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7097) .cse0 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7097) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 04:48:25,706 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7098))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7097) .cse1 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7097) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd (_ bv12 32) .cse4))))))) is different from false [2023-11-29 04:48:26,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7099 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7191))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7098))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7192) .cse0 v_ArrVal_7097) .cse1 v_ArrVal_7100) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7099) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7097 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7098 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7191 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7192 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7100 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7191))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7192) .cse6 v_ArrVal_7097) (select (select (store .cse7 .cse6 v_ArrVal_7098) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7100))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 04:48:27,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:48:27,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1646408589] [2023-11-29 04:48:27,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1646408589] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:27,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [69618965] [2023-11-29 04:48:27,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:48:27,008 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:48:27,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:48:27,009 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:48:27,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 04:48:56,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:48:56,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 04:48:56,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:48:56,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:48:56,840 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:48:56,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:48:56,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:48:56,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:48:56,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:48:56,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:48:56,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:48:57,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:57,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:48:57,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:48:57,636 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:57,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:48:57,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:48:57,697 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:48:57,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:48:57,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:48:57,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:48:57,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:48:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:48:57,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:57,782 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 04:48:57,815 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:48:57,858 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7677))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7678) .cse0 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7678) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 04:48:57,901 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7678) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7677))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7678) .cse3 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:48:59,285 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7771))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7772) .cse1 v_ArrVal_7678) (select (select (store .cse2 .cse1 v_ArrVal_7677) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7680))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7680 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7679 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7678 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7677 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7772 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7771 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7771))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7677))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7772) .cse4 v_ArrVal_7678) .cse5 v_ArrVal_7680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7679) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 04:48:59,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [69618965] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:59,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:48:59,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 04:48:59,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430858451] [2023-11-29 04:48:59,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:48:59,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:48:59,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:48:59,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:48:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2023-11-29 04:48:59,301 INFO L87 Difference]: Start difference. First operand 1005 states and 1226 transitions. Second operand has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:49:06,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:06,820 INFO L93 Difference]: Finished difference Result 1410 states and 1757 transitions. [2023-11-29 04:49:06,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:49:06,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 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 112 [2023-11-29 04:49:06,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:06,824 INFO L225 Difference]: With dead ends: 1410 [2023-11-29 04:49:06,824 INFO L226 Difference]: Without dead ends: 1410 [2023-11-29 04:49:06,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2023-11-29 04:49:06,825 INFO L413 NwaCegarLoop]: 415 mSDtfsCounter, 653 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 2958 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 2964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 2958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:06,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 1536 Invalid, 2964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 2958 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-29 04:49:06,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2023-11-29 04:49:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1004. [2023-11-29 04:49:06,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1004 states, 645 states have (on average 1.8852713178294573) internal successors, (1216), 997 states have internal predecessors, (1216), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:49:06,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1225 transitions. [2023-11-29 04:49:06,837 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1225 transitions. Word has length 112 [2023-11-29 04:49:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:06,837 INFO L495 AbstractCegarLoop]: Abstraction has 1004 states and 1225 transitions. [2023-11-29 04:49:06,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.555555555555555) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:49:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1225 transitions. [2023-11-29 04:49:06,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:49:06,838 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:06,838 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:06,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 04:49:07,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 04:49:07,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:49:07,238 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:49:07,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash 2091508161, now seen corresponding path program 1 times [2023-11-29 04:49:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:07,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331597145] [2023-11-29 04:49:07,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:07,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:07,241 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:07,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 04:49:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:08,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 04:49:08,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:08,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:49:08,381 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:49:08,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:49:08,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:49:08,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:49:09,357 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:49:09,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:49:09,456 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:49:09,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 44 treesize of output 43 [2023-11-29 04:49:09,539 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:49:09,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:49:09,634 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:49:09,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:49:09,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:49:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:49:09,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:09,757 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8228) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:49:09,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8227))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:49:09,964 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8226))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:49:09,982 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:49:10,381 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8274 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8228 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8227 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8226 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8274))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8226)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8227)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8228)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:49:10,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:10,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331597145] [2023-11-29 04:49:10,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331597145] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:10,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [390382256] [2023-11-29 04:49:10,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:10,386 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:49:10,386 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:49:10,387 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:49:10,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 04:49:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:50,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 04:49:50,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:50,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:49:50,813 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:49:50,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:49:50,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:49:51,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:49:51,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:49:51,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:49:51,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:49:51,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 36 treesize of output 35 [2023-11-29 04:49:52,097 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:49:52,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:49:52,214 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:49:52,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:49:52,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:49:52,238 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:49:52,238 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:52,254 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:49:52,265 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:49:52,278 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8730))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:49:52,291 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:49:52,306 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8729))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:49:52,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:49:52,729 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8777))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8729)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8730)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8731)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:49:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [390382256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:52,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:49:52,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 04:49:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776727957] [2023-11-29 04:49:52,734 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:49:52,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:49:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:49:52,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=402, Unknown=15, NotChecked=636, Total=1190 [2023-11-29 04:49:52,736 INFO L87 Difference]: Start difference. First operand 1004 states and 1225 transitions. Second operand has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:50:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:50:02,173 INFO L93 Difference]: Finished difference Result 1409 states and 1756 transitions. [2023-11-29 04:50:02,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:50:02,175 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 114 [2023-11-29 04:50:02,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:50:02,178 INFO L225 Difference]: With dead ends: 1409 [2023-11-29 04:50:02,178 INFO L226 Difference]: Without dead ends: 1409 [2023-11-29 04:50:02,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=148, Invalid=437, Unknown=15, NotChecked=660, Total=1260 [2023-11-29 04:50:02,179 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 1327 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 4076 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 3484 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 4076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:50:02,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 3484 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 4076 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2023-11-29 04:50:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2023-11-29 04:50:02,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1003. [2023-11-29 04:50:02,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 645 states have (on average 1.8837209302325582) internal successors, (1215), 996 states have internal predecessors, (1215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:50:02,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1224 transitions. [2023-11-29 04:50:02,191 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1224 transitions. Word has length 114 [2023-11-29 04:50:02,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:50:02,191 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1224 transitions. [2023-11-29 04:50:02,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.25) internal successors, (132), 19 states have internal predecessors, (132), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:50:02,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1224 transitions. [2023-11-29 04:50:02,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 04:50:02,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:50:02,192 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:50:02,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 04:50:02,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-11-29 04:50:02,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:50:02,593 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:50:02,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:50:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash 2091508162, now seen corresponding path program 1 times [2023-11-29 04:50:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:50:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306776804] [2023-11-29 04:50:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:02,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 04:50:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:50:02,595 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:50:02,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 04:50:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:03,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:50:03,805 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:03,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:50:04,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:50:04,102 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:50:04,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:50:04,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:50:04,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:50:04,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:50:04,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:50:04,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:50:04,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:50:04,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:50:04,959 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:50:04,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:50:04,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:50:05,045 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:50:05,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:50:05,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:50:05,135 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:50:05,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:50:05,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:50:05,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:50:05,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:50:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:50:05,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:50:05,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 04:50:05,399 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:50:05,461 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9279))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9280) .cse0 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9280) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:50:06,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9278))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9279))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9277) .cse0 v_ArrVal_9280) .cse1 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9278))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9277) .cse6 v_ArrVal_9280) (select (select (store .cse7 .cse6 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9281))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 04:50:07,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9278))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9279))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9277) .cse1 v_ArrVal_9280) .cse2 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9278))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9277) .cse7 v_ArrVal_9280) (select (select (store .cse8 .cse7 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9281))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 04:50:13,406 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9373))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9278))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9374) .cse1 v_ArrVal_9277) .cse2 v_ArrVal_9280) (select (select (store .cse3 .cse2 v_ArrVal_9279) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9281))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9374 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9373 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9281 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9280 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9279 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9278 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9373))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9278))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9279))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9374) .cse6 v_ArrVal_9277) .cse7 v_ArrVal_9280) .cse8 v_ArrVal_9281) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9282) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 04:50:13,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:50:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306776804] [2023-11-29 04:50:13,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306776804] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:50:13,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762709066] [2023-11-29 04:50:13,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:50:13,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:50:13,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:50:13,444 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:50:13,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 04:50:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:50:57,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 04:50:57,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:50:57,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:51:00,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 04:51:00,158 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:51:00,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:51:00,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:51:00,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:51:00,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:51:00,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:51:06,246 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:06,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:51:06,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:51:06,885 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:06,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:51:06,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:51:07,371 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:07,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:51:07,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:51:07,829 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:07,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:51:07,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:51:08,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:51:08,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:51:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:51:08,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:08,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:51:08,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:51:08,615 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9877))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9876) .cse0 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9876) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:51:08,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9877))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9876) .cse1 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9876) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-11-29 04:51:09,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9875))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9877))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9874) .cse0 v_ArrVal_9876) .cse1 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9875))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9874) .cse6 v_ArrVal_9876) (select (select (store .cse7 .cse6 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9878))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 04:51:31,721 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9971))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9875))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9877))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9970) .cse0 v_ArrVal_9874) .cse1 v_ArrVal_9876) .cse2 v_ArrVal_9878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9970 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9874 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9971 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9971))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9875))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9970) .cse8 v_ArrVal_9874) .cse9 v_ArrVal_9876) (select (select (store .cse10 .cse9 v_ArrVal_9877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9878))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 04:51:31,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [762709066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:51:31,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:51:31,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 04:51:31,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172978988] [2023-11-29 04:51:31,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:51:31,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 04:51:31,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:31,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 04:51:31,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=182, Unknown=32, NotChecked=468, Total=756 [2023-11-29 04:51:31,768 INFO L87 Difference]: Start difference. First operand 1003 states and 1224 transitions. Second operand has 12 states, 10 states have (on average 7.0) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:42,079 INFO L93 Difference]: Finished difference Result 1408 states and 1755 transitions. [2023-11-29 04:52:42,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:52:42,082 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.0) internal successors, (70), 12 states have internal predecessors, (70), 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 114 [2023-11-29 04:52:42,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:42,086 INFO L225 Difference]: With dead ends: 1408 [2023-11-29 04:52:42,086 INFO L226 Difference]: Without dead ends: 1408 [2023-11-29 04:52:42,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 217 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 44.1s TimeCoverageRelationStatistics Valid=131, Invalid=382, Unknown=41, NotChecked=636, Total=1190 [2023-11-29 04:52:42,087 INFO L413 NwaCegarLoop]: 414 mSDtfsCounter, 651 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 2966 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:42,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 1537 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2966 Invalid, 0 Unknown, 0 Unchecked, 52.1s Time] [2023-11-29 04:52:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2023-11-29 04:52:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1002. [2023-11-29 04:52:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1002 states, 645 states have (on average 1.882170542635659) internal successors, (1214), 995 states have internal predecessors, (1214), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:52:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1223 transitions. [2023-11-29 04:52:42,103 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1223 transitions. Word has length 114 [2023-11-29 04:52:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:42,103 INFO L495 AbstractCegarLoop]: Abstraction has 1002 states and 1223 transitions. [2023-11-29 04:52:42,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.0) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:52:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1223 transitions. [2023-11-29 04:52:42,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 04:52:42,104 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:42,104 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:42,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-11-29 04:52:42,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 04:52:42,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:52:42,505 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:52:42,505 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash -103997465, now seen corresponding path program 1 times [2023-11-29 04:52:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [353027435] [2023-11-29 04:52:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:42,506 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:42,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:42,507 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:42,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 04:52:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:43,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 04:52:43,855 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:43,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:52:45,750 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:52:45,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:52:46,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:52:46,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:52:54,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:54,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:52:55,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:55,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:52:56,284 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:56,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:52:57,072 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:57,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:52:57,897 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:57,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:52:57,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:52:58,371 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 04:52:58,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 04:52:58,859 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:52:58,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:59,785 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10445) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:52:59,868 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10445) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:52:59,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10444))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:53:00,039 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:00,128 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:00,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:00,315 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10442))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:53:00,416 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:02,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10492 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10443 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10444 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10442 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ BitVec 32)) (v_ArrVal_10445 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10492))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10442)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10443)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10444)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10445)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:02,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:53:02,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [353027435] [2023-11-29 04:53:02,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [353027435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:02,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [557220751] [2023-11-29 04:53:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:53:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:53:02,514 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:53:02,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 04:53:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:06,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 04:53:06,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:06,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:53:10,225 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:53:10,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:53:10,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:12,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-11-29 04:53:22,305 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:22,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:24,047 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:24,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:25,102 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:25,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:26,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:26,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:27,353 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:27,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:28,018 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-11-29 04:53:28,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2023-11-29 04:53:28,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:53:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 04:53:28,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:34,197 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10966) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 04:53:34,321 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 04:53:34,444 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 04:53:34,572 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))))) is different from false [2023-11-29 04:53:34,702 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 04:53:34,837 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 04:53:34,978 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc43#1.base_17| (_ BitVec 32)) (v_ArrVal_10964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10965 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10963 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10966 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10967 (_ BitVec 1))) (or (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17| v_ArrVal_10967) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10963))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10964)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10965)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10966)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc43#1.base_17|))))) is different from false [2023-11-29 04:53:37,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [557220751] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:37,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:53:37,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 04:53:37,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941658818] [2023-11-29 04:53:37,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:37,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:53:37,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:53:37,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:53:37,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=631, Unknown=25, NotChecked=1072, Total=1892 [2023-11-29 04:53:37,926 INFO L87 Difference]: Start difference. First operand 1002 states and 1223 transitions. Second operand has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:55:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:55:08,141 INFO L93 Difference]: Finished difference Result 1407 states and 1754 transitions. [2023-11-29 04:55:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:55:08,144 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 116 [2023-11-29 04:55:08,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:55:08,146 INFO L225 Difference]: With dead ends: 1407 [2023-11-29 04:55:08,147 INFO L226 Difference]: Without dead ends: 1407 [2023-11-29 04:55:08,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 208 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=174, Invalid=677, Unknown=25, NotChecked=1104, Total=1980 [2023-11-29 04:55:08,148 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 685 mSDsluCounter, 4063 mSDsCounter, 0 mSdLazyCounter, 5212 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 4450 SdHoareTripleChecker+Invalid, 5218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:55:08,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 4450 Invalid, 5218 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6 Valid, 5212 Invalid, 0 Unknown, 0 Unchecked, 89.6s Time] [2023-11-29 04:55:08,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2023-11-29 04:55:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1001. [2023-11-29 04:55:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 645 states have (on average 1.8806201550387598) internal successors, (1213), 994 states have internal predecessors, (1213), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 04:55:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1222 transitions. [2023-11-29 04:55:08,160 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1222 transitions. Word has length 116 [2023-11-29 04:55:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:55:08,160 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1222 transitions. [2023-11-29 04:55:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.0) internal successors, (140), 23 states have internal predecessors, (140), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:55:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1222 transitions. [2023-11-29 04:55:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 04:55:08,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:55:08,161 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:55:08,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 04:55:08,372 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-11-29 04:55:08,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:08,562 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2023-11-29 04:55:08,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:55:08,562 INFO L85 PathProgramCache]: Analyzing trace with hash -103997464, now seen corresponding path program 1 times [2023-11-29 04:55:08,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:55:08,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164602820] [2023-11-29 04:55:08,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:55:08,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:55:08,563 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:55:08,564 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:55:08,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e855bc88-56a3-4a7b-b95c-b4fa0ff8fabd/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-29 04:55:09,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:55:09,918 INFO L262 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 126 conjunts are in the unsatisfiable core [2023-11-29 04:55:09,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:55:09,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:55:11,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:55:11,978 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:55:11,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:55:12,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:55:12,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:55:13,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 04:55:13,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:55:25,441 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:55:25,441 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 75 treesize of output 68 [2023-11-29 04:55:25,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:55:26,699 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:55:26,699 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 75 treesize of output 68 [2023-11-29 04:55:26,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:55:27,712 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:55:27,713 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 75 treesize of output 68 [2023-11-29 04:55:27,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13