./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:55:58,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:55:58,842 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:55:58,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:55:58,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:55:58,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:55:58,870 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:55:58,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:55:58,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:55:58,871 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:55:58,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:55:58,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:55:58,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:55:58,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:55:58,874 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:55:58,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:55:58,875 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:55:58,876 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:55:58,876 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:55:58,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:55:58,877 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:55:58,878 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:55:58,878 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:55:58,879 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:55:58,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:55:58,880 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:55:58,880 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:55:58,880 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:55:58,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:55:58,881 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:55:58,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:55:58,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:55:58,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:55:58,882 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:55:58,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:55:58,883 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:55:58,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:55:58,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:55:58,883 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:55:58,883 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:55:58,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:55:58,884 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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2023-11-29 06:55:59,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:55:59,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:55:59,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:55:59,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:55:59,151 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:55:59,152 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2023-11-29 06:56:01,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:56:02,151 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:56:02,152 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2023-11-29 06:56:02,170 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data/437613dee/fc19f1a508fb4af989d809a8de97be68/FLAG2df319157 [2023-11-29 06:56:02,183 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data/437613dee/fc19f1a508fb4af989d809a8de97be68 [2023-11-29 06:56:02,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:56:02,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:56:02,188 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:02,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:56:02,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:56:02,194 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,195 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4644faf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02, skipping insertion in model container [2023-11-29 06:56:02,195 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:02" (1/1) ... [2023-11-29 06:56:02,258 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:56:02,741 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:02,753 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 06:56:02,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@20cd885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:02, skipping insertion in model container [2023-11-29 06:56:02,754 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:02,754 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 06:56:02,756 INFO L158 Benchmark]: Toolchain (without parser) took 568.07ms. Allocated memory is still 190.8MB. Free memory was 151.5MB in the beginning and 131.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 06:56:02,757 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 190.8MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:56:02,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 565.58ms. Allocated memory is still 190.8MB. Free memory was 151.2MB in the beginning and 131.1MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 06:56:02,759 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.17ms. Allocated memory is still 190.8MB. Free memory is still 167.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 565.58ms. Allocated memory is still 190.8MB. Free memory was 151.2MB in the beginning and 131.1MB in the end (delta: 20.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 815]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:56:04,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:56:04,566 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:56:04,580 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:56:04,581 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:56:04,607 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:56:04,608 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:56:04,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:56:04,609 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:56:04,610 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:56:04,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:56:04,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:56:04,612 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:56:04,613 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:56:04,613 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:56:04,614 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:56:04,614 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:56:04,615 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:56:04,615 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:56:04,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:56:04,616 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:56:04,616 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:56:04,617 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:56:04,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:56:04,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:56:04,618 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:56:04,618 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:56:04,619 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:56:04,619 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:56:04,619 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:56:04,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:56:04,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:56:04,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:56:04,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:56:04,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:56:04,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:56:04,622 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:56:04,622 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:56:04,622 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:56:04,622 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:56:04,622 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:56:04,623 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:56:04,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:56:04,623 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:56:04,623 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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2023-11-29 06:56:04,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:56:04,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:56:04,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:56:04,940 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:56:04,941 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:56:04,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2023-11-29 06:56:07,715 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:56:08,020 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:56:08,021 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2023-11-29 06:56:08,039 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data/d0e1afad5/aa5ec9c43d3c4133948bc9382ec7acff/FLAG4b8f609f6 [2023-11-29 06:56:08,051 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/data/d0e1afad5/aa5ec9c43d3c4133948bc9382ec7acff [2023-11-29 06:56:08,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:56:08,055 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:56:08,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:08,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:56:08,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:56:08,061 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:08,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12575232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08, skipping insertion in model container [2023-11-29 06:56:08,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:08,125 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:56:08,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:08,609 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 06:56:08,624 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:56:08,708 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:08,714 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:56:08,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:56:08,825 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:56:08,833 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:56:08,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08 WrapperNode [2023-11-29 06:56:08,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:56:08,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:56:08,834 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:56:08,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:56:08,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:08,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:08,947 INFO L138 Inliner]: procedures = 211, calls = 288, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1060 [2023-11-29 06:56:08,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:56:08,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:56:08,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:56:08,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:56:08,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:08,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:08,971 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,045 INFO L175 MemorySlicer]: Split 261 memory accesses to 4 slices as follows [2, 220, 5, 34]. 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, 50, 1, 4]. [2023-11-29 06:56:09,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,085 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,108 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,118 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:56:09,119 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:56:09,120 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:56:09,120 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:56:09,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (1/1) ... [2023-11-29 06:56:09,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:56:09,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:56:09,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:56:09,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 06:56:09,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 06:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:56:09,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 06:56:09,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 06:56:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 06:56:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 06:56:09,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 06:56:09,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 06:56:09,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 06:56:09,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 06:56:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:56:09,189 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:56:09,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:56:09,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 06:56:09,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:56:09,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:56:09,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:56:09,406 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:56:09,408 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:56:09,430 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:56:09,466 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:56:09,487 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:56:09,508 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:56:13,519 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:56:13,714 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:56:13,714 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-11-29 06:56:13,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:13 BoogieIcfgContainer [2023-11-29 06:56:13,715 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:56:13,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:56:13,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:56:13,720 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:56:13,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:56:08" (1/3) ... [2023-11-29 06:56:13,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6975cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:56:13, skipping insertion in model container [2023-11-29 06:56:13,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:56:08" (2/3) ... [2023-11-29 06:56:13,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d6975cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:56:13, skipping insertion in model container [2023-11-29 06:56:13,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:56:13" (3/3) ... [2023-11-29 06:56:13,723 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-2.i [2023-11-29 06:56:13,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:56:13,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 535 error locations. [2023-11-29 06:56:13,803 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:56:13,810 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;@15827395, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:56:13,810 INFO L358 AbstractCegarLoop]: Starting to check reachability of 535 error locations. [2023-11-29 06:56:13,817 INFO L276 IsEmpty]: Start isEmpty. Operand has 984 states, 438 states have (on average 2.5136986301369864) internal successors, (1101), 977 states have internal predecessors, (1101), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-29 06:56:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 06:56:13,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:13,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 06:56:13,823 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:13,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:13,828 INFO L85 PathProgramCache]: Analyzing trace with hash 56252, now seen corresponding path program 1 times [2023-11-29 06:56:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:13,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311182019] [2023-11-29 06:56:13,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:13,841 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 06:56:13,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:13,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:13,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:14,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:56:14,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:14,085 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 06:56:14,096 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 06:56:14,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:14,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:14,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311182019] [2023-11-29 06:56:14,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311182019] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:14,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:14,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:56:14,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108001146] [2023-11-29 06:56:14,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:14,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:14,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:14,139 INFO L87 Difference]: Start difference. First operand has 984 states, 438 states have (on average 2.5136986301369864) internal successors, (1101), 977 states have internal predecessors, (1101), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) 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 06:56:15,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:15,963 INFO L93 Difference]: Finished difference Result 1136 states and 1212 transitions. [2023-11-29 06:56:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:15,966 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 06:56:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:15,985 INFO L225 Difference]: With dead ends: 1136 [2023-11-29 06:56:15,986 INFO L226 Difference]: Without dead ends: 1135 [2023-11-29 06:56:15,987 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 06:56:15,990 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 906 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:15,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 674 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:56:16,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2023-11-29 06:56:16,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 970. [2023-11-29 06:56:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 441 states have (on average 2.312925170068027) internal successors, (1020), 963 states have internal predecessors, (1020), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:56:16,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1038 transitions. [2023-11-29 06:56:16,069 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1038 transitions. Word has length 2 [2023-11-29 06:56:16,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:16,070 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1038 transitions. [2023-11-29 06:56:16,070 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 06:56:16,070 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1038 transitions. [2023-11-29 06:56:16,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 06:56:16,070 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:16,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 06:56:16,074 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:16,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:16,271 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:16,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:16,272 INFO L85 PathProgramCache]: Analyzing trace with hash 56253, now seen corresponding path program 1 times [2023-11-29 06:56:16,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:16,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480943989] [2023-11-29 06:56:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:16,273 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 06:56:16,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:16,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:16,275 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:16,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:56:16,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:16,390 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 06:56:16,400 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 06:56:16,400 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:16,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:16,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480943989] [2023-11-29 06:56:16,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480943989] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:16,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 06:56:16,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240695874] [2023-11-29 06:56:16,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:16,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:16,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:16,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:16,404 INFO L87 Difference]: Start difference. First operand 970 states and 1038 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 06:56:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:19,404 INFO L93 Difference]: Finished difference Result 1351 states and 1462 transitions. [2023-11-29 06:56:19,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:19,405 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 06:56:19,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:19,413 INFO L225 Difference]: With dead ends: 1351 [2023-11-29 06:56:19,413 INFO L226 Difference]: Without dead ends: 1351 [2023-11-29 06:56:19,413 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 06:56:19,415 INFO L413 NwaCegarLoop]: 775 mSDtfsCounter, 413 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:19,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1274 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 06:56:19,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2023-11-29 06:56:19,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1082. [2023-11-29 06:56:19,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 549 states have (on average 2.255009107468124) internal successors, (1238), 1075 states have internal predecessors, (1238), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1266 transitions. [2023-11-29 06:56:19,441 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1266 transitions. Word has length 2 [2023-11-29 06:56:19,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:19,441 INFO L495 AbstractCegarLoop]: Abstraction has 1082 states and 1266 transitions. [2023-11-29 06:56:19,441 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 06:56:19,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1266 transitions. [2023-11-29 06:56:19,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 06:56:19,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:19,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 06:56:19,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:56:19,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:19,643 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:19,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:19,643 INFO L85 PathProgramCache]: Analyzing trace with hash 411041670, now seen corresponding path program 1 times [2023-11-29 06:56:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:19,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912021138] [2023-11-29 06:56:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:56:19,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:19,646 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:19,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:19,764 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:56:19,766 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:19,778 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 06:56:19,785 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 06:56:19,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:56:19,847 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 06:56:19,866 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:56:19,867 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 06:56:19,885 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 06:56:19,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:19,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:19,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912021138] [2023-11-29 06:56:19,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912021138] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:19,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:19,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:56:19,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026366072] [2023-11-29 06:56:19,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:19,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:19,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:19,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:19,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:19,902 INFO L87 Difference]: Start difference. First operand 1082 states and 1266 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 06:56:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:22,806 INFO L93 Difference]: Finished difference Result 1236 states and 1428 transitions. [2023-11-29 06:56:22,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:22,806 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 06:56:22,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:22,814 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 06:56:22,814 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 06:56:22,814 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 06:56:22,816 INFO L413 NwaCegarLoop]: 283 mSDtfsCounter, 2045 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2053 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:22,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2053 Valid, 344 Invalid, 997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 06:56:22,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 06:56:22,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 959. [2023-11-29 06:56:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 441 states have (on average 2.2857142857142856) internal successors, (1008), 952 states have internal predecessors, (1008), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:56:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1026 transitions. [2023-11-29 06:56:22,850 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1026 transitions. Word has length 6 [2023-11-29 06:56:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:22,851 INFO L495 AbstractCegarLoop]: Abstraction has 959 states and 1026 transitions. [2023-11-29 06:56:22,851 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 06:56:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1026 transitions. [2023-11-29 06:56:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 06:56:22,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:22,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:22,855 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:23,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:23,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:23,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:23,056 INFO L85 PathProgramCache]: Analyzing trace with hash -142610108, now seen corresponding path program 1 times [2023-11-29 06:56:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:23,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683456535] [2023-11-29 06:56:23,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:23,057 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 06:56:23,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:23,058 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:23,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:23,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:56:23,164 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:23,168 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 06:56:23,178 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 06:56:23,179 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:23,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:23,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683456535] [2023-11-29 06:56:23,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683456535] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:23,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:23,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:56:23,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795308965] [2023-11-29 06:56:23,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:23,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:23,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:23,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:23,180 INFO L87 Difference]: Start difference. First operand 959 states and 1026 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:24,965 INFO L93 Difference]: Finished difference Result 1112 states and 1211 transitions. [2023-11-29 06:56:24,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:24,967 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 06:56:24,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:24,972 INFO L225 Difference]: With dead ends: 1112 [2023-11-29 06:56:24,972 INFO L226 Difference]: Without dead ends: 1112 [2023-11-29 06:56:24,973 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 06:56:24,974 INFO L413 NwaCegarLoop]: 743 mSDtfsCounter, 732 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:24,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 984 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 06:56:24,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-11-29 06:56:24,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 912. [2023-11-29 06:56:24,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 441 states have (on average 2.179138321995465) internal successors, (961), 905 states have internal predecessors, (961), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:56:24,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 979 transitions. [2023-11-29 06:56:24,995 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 979 transitions. Word has length 7 [2023-11-29 06:56:24,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:24,996 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 979 transitions. [2023-11-29 06:56:24,996 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 06:56:24,996 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 979 transitions. [2023-11-29 06:56:24,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 06:56:24,997 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:24,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:24,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:25,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:25,199 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:25,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -142610107, now seen corresponding path program 1 times [2023-11-29 06:56:25,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777095889] [2023-11-29 06:56:25,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:25,200 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 06:56:25,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:25,201 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:25,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:25,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:56:25,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:25,315 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 06:56:25,335 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 06:56:25,336 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:25,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:25,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777095889] [2023-11-29 06:56:25,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777095889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:25,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:25,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:56:25,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808973775] [2023-11-29 06:56:25,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:25,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:25,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:25,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:25,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:25,338 INFO L87 Difference]: Start difference. First operand 912 states and 979 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 06:56:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:27,947 INFO L93 Difference]: Finished difference Result 1170 states and 1272 transitions. [2023-11-29 06:56:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:27,948 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 06:56:27,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:27,952 INFO L225 Difference]: With dead ends: 1170 [2023-11-29 06:56:27,952 INFO L226 Difference]: Without dead ends: 1170 [2023-11-29 06:56:27,952 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 06:56:27,953 INFO L413 NwaCegarLoop]: 901 mSDtfsCounter, 450 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:27,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 1267 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 06:56:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-11-29 06:56:27,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 925. [2023-11-29 06:56:27,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 925 states, 464 states have (on average 2.1724137931034484) internal successors, (1008), 918 states have internal predecessors, (1008), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-29 06:56:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 925 states to 925 states and 1026 transitions. [2023-11-29 06:56:27,972 INFO L78 Accepts]: Start accepts. Automaton has 925 states and 1026 transitions. Word has length 7 [2023-11-29 06:56:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:27,973 INFO L495 AbstractCegarLoop]: Abstraction has 925 states and 1026 transitions. [2023-11-29 06:56:27,973 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 06:56:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 925 states and 1026 transitions. [2023-11-29 06:56:27,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:56:27,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:27,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:27,976 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:28,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:28,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr428REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:28,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1512898287, now seen corresponding path program 1 times [2023-11-29 06:56:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481350304] [2023-11-29 06:56:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:28,175 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 06:56:28,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:28,176 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:28,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:28,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:56:28,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:28,341 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 06:56:28,341 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:28,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:28,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481350304] [2023-11-29 06:56:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481350304] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:56:28,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675340742] [2023-11-29 06:56:28,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:28,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:28,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:28,343 INFO L87 Difference]: Start difference. First operand 925 states and 1026 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:29,438 INFO L93 Difference]: Finished difference Result 1356 states and 1503 transitions. [2023-11-29 06:56:29,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:29,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 06:56:29,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:29,445 INFO L225 Difference]: With dead ends: 1356 [2023-11-29 06:56:29,445 INFO L226 Difference]: Without dead ends: 1356 [2023-11-29 06:56:29,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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 06:56:29,446 INFO L413 NwaCegarLoop]: 902 mSDtfsCounter, 516 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:29,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1623 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 06:56:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2023-11-29 06:56:29,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1079. [2023-11-29 06:56:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1079 states, 613 states have (on average 2.096247960848287) internal successors, (1285), 1072 states have internal predecessors, (1285), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:29,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1313 transitions. [2023-11-29 06:56:29,468 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1313 transitions. Word has length 10 [2023-11-29 06:56:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:29,468 INFO L495 AbstractCegarLoop]: Abstraction has 1079 states and 1313 transitions. [2023-11-29 06:56:29,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:29,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1313 transitions. [2023-11-29 06:56:29,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:56:29,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:29,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:29,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 06:56:29,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:29,670 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr341REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:29,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1725604592, now seen corresponding path program 1 times [2023-11-29 06:56:29,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:29,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135089877] [2023-11-29 06:56:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:29,671 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 06:56:29,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:29,672 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:29,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:29,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:56:29,796 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:29,803 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 06:56:29,803 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:29,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:29,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135089877] [2023-11-29 06:56:29,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135089877] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:29,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:29,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458653499] [2023-11-29 06:56:29,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:29,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:29,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:29,805 INFO L87 Difference]: Start difference. First operand 1079 states and 1313 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:30,604 INFO L93 Difference]: Finished difference Result 1025 states and 1233 transitions. [2023-11-29 06:56:30,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:30,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 06:56:30,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:30,610 INFO L225 Difference]: With dead ends: 1025 [2023-11-29 06:56:30,610 INFO L226 Difference]: Without dead ends: 1025 [2023-11-29 06:56:30,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:30,611 INFO L413 NwaCegarLoop]: 805 mSDtfsCounter, 70 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:30,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1561 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:56:30,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2023-11-29 06:56:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 1025. [2023-11-29 06:56:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 583 states have (on average 2.0668953687821614) internal successors, (1205), 1018 states have internal predecessors, (1205), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1233 transitions. [2023-11-29 06:56:30,633 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1233 transitions. Word has length 12 [2023-11-29 06:56:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:30,634 INFO L495 AbstractCegarLoop]: Abstraction has 1025 states and 1233 transitions. [2023-11-29 06:56:30,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1233 transitions. [2023-11-29 06:56:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 06:56:30,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:30,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:30,637 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:30,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:30,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr533ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:30,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 641111906, now seen corresponding path program 1 times [2023-11-29 06:56:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:30,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2120360404] [2023-11-29 06:56:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:30,836 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 06:56:30,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:30,837 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:30,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:30,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 06:56:30,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:30,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:30,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:30,976 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 06:56:30,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-11-29 06:56:31,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:56:31,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-11-29 06:56:31,046 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 06:56:31,046 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:31,046 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:31,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2120360404] [2023-11-29 06:56:31,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2120360404] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:31,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:31,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:31,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357835625] [2023-11-29 06:56:31,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:31,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:31,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:31,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:31,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:31,048 INFO L87 Difference]: Start difference. First operand 1025 states and 1233 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 06:56:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:32,790 INFO L93 Difference]: Finished difference Result 1786 states and 2016 transitions. [2023-11-29 06:56:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2023-11-29 06:56:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:32,797 INFO L225 Difference]: With dead ends: 1786 [2023-11-29 06:56:32,797 INFO L226 Difference]: Without dead ends: 1786 [2023-11-29 06:56:32,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 06:56:32,798 INFO L413 NwaCegarLoop]: 989 mSDtfsCounter, 851 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:32,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 2774 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:56:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2023-11-29 06:56:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1024. [2023-11-29 06:56:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 582 states have (on average 2.0670103092783507) internal successors, (1203), 1017 states have internal predecessors, (1203), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:32,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1231 transitions. [2023-11-29 06:56:32,818 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1231 transitions. Word has length 13 [2023-11-29 06:56:32,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:32,818 INFO L495 AbstractCegarLoop]: Abstraction has 1024 states and 1231 transitions. [2023-11-29 06:56:32,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 06:56:32,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1231 transitions. [2023-11-29 06:56:32,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 06:56:32,819 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:32,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:32,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:33,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:33,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:33,021 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:33,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1860699003, now seen corresponding path program 1 times [2023-11-29 06:56:33,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:33,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [860366470] [2023-11-29 06:56:33,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:33,022 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 06:56:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:33,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:33,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:33,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:56:33,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:33,176 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 06:56:33,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:33,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:33,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [860366470] [2023-11-29 06:56:33,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [860366470] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:33,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625994627] [2023-11-29 06:56:33,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:33,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:56:33,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:33,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:56:33,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:56:33,179 INFO L87 Difference]: Start difference. First operand 1024 states and 1231 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 06:56:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:33,852 INFO L93 Difference]: Finished difference Result 970 states and 1151 transitions. [2023-11-29 06:56:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:56:33,853 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 06:56:33,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:33,857 INFO L225 Difference]: With dead ends: 970 [2023-11-29 06:56:33,857 INFO L226 Difference]: Without dead ends: 970 [2023-11-29 06:56:33,857 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 06:56:33,857 INFO L413 NwaCegarLoop]: 768 mSDtfsCounter, 70 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:33,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1487 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:56:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2023-11-29 06:56:33,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2023-11-29 06:56:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 552 states have (on average 2.0344202898550723) internal successors, (1123), 963 states have internal predecessors, (1123), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1151 transitions. [2023-11-29 06:56:33,878 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1151 transitions. Word has length 15 [2023-11-29 06:56:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:33,878 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1151 transitions. [2023-11-29 06:56:33,879 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 06:56:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1151 transitions. [2023-11-29 06:56:33,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 06:56:33,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:33,879 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 06:56:33,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:34,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:34,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:34,080 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1425344277, now seen corresponding path program 1 times [2023-11-29 06:56:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691412303] [2023-11-29 06:56:34,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:34,081 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 06:56:34,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:34,082 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:34,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:34,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:56:34,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:34,241 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 06:56:34,241 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:34,241 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691412303] [2023-11-29 06:56:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691412303] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:34,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:34,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:34,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057551998] [2023-11-29 06:56:34,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:34,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:34,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:34,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:34,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:34,243 INFO L87 Difference]: Start difference. First operand 970 states and 1151 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 06:56:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:35,133 INFO L93 Difference]: Finished difference Result 956 states and 1109 transitions. [2023-11-29 06:56:35,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:35,135 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 06:56:35,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:35,140 INFO L225 Difference]: With dead ends: 956 [2023-11-29 06:56:35,140 INFO L226 Difference]: Without dead ends: 956 [2023-11-29 06:56:35,140 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 06:56:35,141 INFO L413 NwaCegarLoop]: 737 mSDtfsCounter, 58 mSDsluCounter, 1450 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2187 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:35,141 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2187 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:56:35,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2023-11-29 06:56:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 954. [2023-11-29 06:56:35,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 550 states have (on average 1.961818181818182) internal successors, (1079), 947 states have internal predecessors, (1079), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:35,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1107 transitions. [2023-11-29 06:56:35,156 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1107 transitions. Word has length 17 [2023-11-29 06:56:35,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:35,156 INFO L495 AbstractCegarLoop]: Abstraction has 954 states and 1107 transitions. [2023-11-29 06:56:35,156 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 06:56:35,157 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1107 transitions. [2023-11-29 06:56:35,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 06:56:35,157 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:35,157 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 06:56:35,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 06:56:35,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:35,358 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:35,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:35,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1980251715, now seen corresponding path program 1 times [2023-11-29 06:56:35,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:35,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [401212724] [2023-11-29 06:56:35,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:35,359 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 06:56:35,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:35,360 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:35,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:35,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:56:35,555 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:35,560 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 06:56:35,630 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 06:56:35,630 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:35,630 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [401212724] [2023-11-29 06:56:35,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [401212724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:35,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:35,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:35,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109347074] [2023-11-29 06:56:35,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:35,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:35,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:35,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:35,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:35,632 INFO L87 Difference]: Start difference. First operand 954 states and 1107 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 06:56:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:37,728 INFO L93 Difference]: Finished difference Result 1178 states and 1407 transitions. [2023-11-29 06:56:37,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:37,729 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 06:56:37,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:37,735 INFO L225 Difference]: With dead ends: 1178 [2023-11-29 06:56:37,735 INFO L226 Difference]: Without dead ends: 1178 [2023-11-29 06:56:37,735 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 06:56:37,735 INFO L413 NwaCegarLoop]: 489 mSDtfsCounter, 625 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:37,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 1057 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 06:56:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2023-11-29 06:56:37,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 950. [2023-11-29 06:56:37,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 550 states have (on average 1.9472727272727273) internal successors, (1071), 943 states have internal predecessors, (1071), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:37,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1099 transitions. [2023-11-29 06:56:37,755 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1099 transitions. Word has length 31 [2023-11-29 06:56:37,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:37,756 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1099 transitions. [2023-11-29 06:56:37,756 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 06:56:37,756 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1099 transitions. [2023-11-29 06:56:37,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 06:56:37,757 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:37,757 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 06:56:37,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:37,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:37,958 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:37,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1980251716, now seen corresponding path program 1 times [2023-11-29 06:56:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117494081] [2023-11-29 06:56:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:37,959 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 06:56:37,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:37,960 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:37,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:38,140 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:56:38,143 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:38,149 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 06:56:38,328 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 06:56:38,328 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:38,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:38,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117494081] [2023-11-29 06:56:38,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117494081] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:38,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:38,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:38,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187275310] [2023-11-29 06:56:38,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:38,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:38,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:38,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:38,331 INFO L87 Difference]: Start difference. First operand 950 states and 1099 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 06:56:41,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:41,366 INFO L93 Difference]: Finished difference Result 1219 states and 1413 transitions. [2023-11-29 06:56:41,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:41,366 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 06:56:41,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:41,371 INFO L225 Difference]: With dead ends: 1219 [2023-11-29 06:56:41,371 INFO L226 Difference]: Without dead ends: 1219 [2023-11-29 06:56:41,372 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 06:56:41,372 INFO L413 NwaCegarLoop]: 876 mSDtfsCounter, 345 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1748 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:41,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1748 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 06:56:41,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-29 06:56:41,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 946. [2023-11-29 06:56:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 550 states have (on average 1.9327272727272726) internal successors, (1063), 939 states have internal predecessors, (1063), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1091 transitions. [2023-11-29 06:56:41,387 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1091 transitions. Word has length 31 [2023-11-29 06:56:41,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:41,387 INFO L495 AbstractCegarLoop]: Abstraction has 946 states and 1091 transitions. [2023-11-29 06:56:41,387 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 06:56:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1091 transitions. [2023-11-29 06:56:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 06:56:41,389 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:41,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:56:41,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:41,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:41,592 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:41,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:41,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1353315314, now seen corresponding path program 1 times [2023-11-29 06:56:41,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:41,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346022597] [2023-11-29 06:56:41,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:41,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 06:56:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:41,595 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:41,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:41,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:56:41,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:41,837 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 06:56:41,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:41,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:41,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346022597] [2023-11-29 06:56:41,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346022597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:41,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372590381] [2023-11-29 06:56:41,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:41,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:41,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:41,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:41,840 INFO L87 Difference]: Start difference. First operand 946 states and 1091 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:42,648 INFO L93 Difference]: Finished difference Result 934 states and 1071 transitions. [2023-11-29 06:56:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2023-11-29 06:56:42,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:42,653 INFO L225 Difference]: With dead ends: 934 [2023-11-29 06:56:42,653 INFO L226 Difference]: Without dead ends: 934 [2023-11-29 06:56:42,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:56:42,654 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 23 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2173 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:42,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2173 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:56:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2023-11-29 06:56:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2023-11-29 06:56:42,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 538 states have (on average 1.9386617100371748) internal successors, (1043), 927 states have internal predecessors, (1043), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1071 transitions. [2023-11-29 06:56:42,673 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1071 transitions. Word has length 50 [2023-11-29 06:56:42,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:42,673 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1071 transitions. [2023-11-29 06:56:42,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:56:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1071 transitions. [2023-11-29 06:56:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 06:56:42,675 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:42,675 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 06:56:42,680 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:42,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:42,880 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:42,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:42,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1912808051, now seen corresponding path program 1 times [2023-11-29 06:56:42,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:42,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757647710] [2023-11-29 06:56:42,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:42,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:56:42,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:42,883 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:42,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:43,164 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 06:56:43,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:43,174 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 06:56:43,178 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 06:56:43,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:56:43,614 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 06:56:43,625 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:56:43,626 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 06:56:43,640 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 06:56:43,640 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:43,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:43,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757647710] [2023-11-29 06:56:43,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757647710] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:43,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:43,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:56:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338490759] [2023-11-29 06:56:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:43,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:43,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:43,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:43,643 INFO L87 Difference]: Start difference. First operand 934 states and 1071 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 06:56:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:45,876 INFO L93 Difference]: Finished difference Result 1124 states and 1341 transitions. [2023-11-29 06:56:45,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:45,877 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 06:56:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:45,883 INFO L225 Difference]: With dead ends: 1124 [2023-11-29 06:56:45,883 INFO L226 Difference]: Without dead ends: 1124 [2023-11-29 06:56:45,883 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 06:56:45,883 INFO L413 NwaCegarLoop]: 366 mSDtfsCounter, 711 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:45,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 598 Invalid, 882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 06:56:45,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2023-11-29 06:56:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 873. [2023-11-29 06:56:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 515 states have (on average 1.840776699029126) internal successors, (948), 866 states have internal predecessors, (948), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 976 transitions. [2023-11-29 06:56:45,897 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 976 transitions. Word has length 54 [2023-11-29 06:56:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:45,898 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 976 transitions. [2023-11-29 06:56:45,898 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 06:56:45,898 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 976 transitions. [2023-11-29 06:56:45,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:56:45,899 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:45,899 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 06:56:45,904 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:46,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:46,100 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:46,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1284972781, now seen corresponding path program 1 times [2023-11-29 06:56:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013828496] [2023-11-29 06:56:46,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:46,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:56:46,101 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:46,101 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:46,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:46,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:56:46,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:46,348 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 06:56:46,361 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 06:56:46,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:56:46,392 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 06:56:46,392 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:46,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:46,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013828496] [2023-11-29 06:56:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013828496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:46,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:46,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:46,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350297079] [2023-11-29 06:56:46,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:46,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:56:46,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:46,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:56:46,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:56:46,394 INFO L87 Difference]: Start difference. First operand 873 states and 976 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 06:56:48,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:48,917 INFO L93 Difference]: Finished difference Result 872 states and 975 transitions. [2023-11-29 06:56:48,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:56:48,918 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 06:56:48,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:48,922 INFO L225 Difference]: With dead ends: 872 [2023-11-29 06:56:48,922 INFO L226 Difference]: Without dead ends: 872 [2023-11-29 06:56:48,922 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 06:56:48,922 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 3 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:48,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1867 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 06:56:48,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2023-11-29 06:56:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2023-11-29 06:56:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 515 states have (on average 1.8388349514563107) internal successors, (947), 865 states have internal predecessors, (947), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 975 transitions. [2023-11-29 06:56:48,932 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 975 transitions. Word has length 58 [2023-11-29 06:56:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:48,933 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 975 transitions. [2023-11-29 06:56:48,933 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 06:56:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 975 transitions. [2023-11-29 06:56:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-29 06:56:48,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:48,933 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 06:56:48,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 06:56:49,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:49,134 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:49,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1284972780, now seen corresponding path program 1 times [2023-11-29 06:56:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746035502] [2023-11-29 06:56:49,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:49,135 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 06:56:49,135 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:49,136 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:49,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:49,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 06:56:49,375 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:49,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:56:49,403 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 06:56:49,407 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 06:56:49,441 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 06:56:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:56:49,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:49,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746035502] [2023-11-29 06:56:49,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1746035502] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:49,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:49,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:49,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91477769] [2023-11-29 06:56:49,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:49,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:56:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:49,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:56:49,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:56:49,460 INFO L87 Difference]: Start difference. First operand 872 states and 975 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 06:56:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:52,513 INFO L93 Difference]: Finished difference Result 871 states and 974 transitions. [2023-11-29 06:56:52,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:56:52,514 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 06:56:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:52,517 INFO L225 Difference]: With dead ends: 871 [2023-11-29 06:56:52,517 INFO L226 Difference]: Without dead ends: 871 [2023-11-29 06:56:52,517 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 06:56:52,518 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:52,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1901 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 06:56:52,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2023-11-29 06:56:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2023-11-29 06:56:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 514 states have (on average 1.8404669260700388) internal successors, (946), 864 states have internal predecessors, (946), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:56:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 974 transitions. [2023-11-29 06:56:52,527 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 974 transitions. Word has length 58 [2023-11-29 06:56:52,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:52,528 INFO L495 AbstractCegarLoop]: Abstraction has 871 states and 974 transitions. [2023-11-29 06:56:52,528 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 06:56:52,528 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 974 transitions. [2023-11-29 06:56:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 06:56:52,528 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:52,528 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 06:56:52,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:52,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:52,729 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:52,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:52,729 INFO L85 PathProgramCache]: Analyzing trace with hash 567496887, now seen corresponding path program 1 times [2023-11-29 06:56:52,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:52,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316172842] [2023-11-29 06:56:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:52,730 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 06:56:52,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:52,731 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:52,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:53,026 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:56:53,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:53,053 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 06:56:53,053 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:56:53,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:53,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [316172842] [2023-11-29 06:56:53,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [316172842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:56:53,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:56:53,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:56:53,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941499171] [2023-11-29 06:56:53,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:56:53,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:56:53,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:53,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:56:53,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:56:53,055 INFO L87 Difference]: Start difference. First operand 871 states and 974 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 06:56:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:53,873 INFO L93 Difference]: Finished difference Result 873 states and 977 transitions. [2023-11-29 06:56:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:56:53,875 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 06:56:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:53,880 INFO L225 Difference]: With dead ends: 873 [2023-11-29 06:56:53,880 INFO L226 Difference]: Without dead ends: 873 [2023-11-29 06:56:53,880 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 06:56:53,881 INFO L413 NwaCegarLoop]: 705 mSDtfsCounter, 1 mSDsluCounter, 1407 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:53,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2112 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 06:56:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2023-11-29 06:56:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 873. [2023-11-29 06:56:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 515 states have (on average 1.840776699029126) internal successors, (948), 866 states have internal predecessors, (948), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 06:56:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 977 transitions. [2023-11-29 06:56:53,894 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 977 transitions. Word has length 64 [2023-11-29 06:56:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:53,894 INFO L495 AbstractCegarLoop]: Abstraction has 873 states and 977 transitions. [2023-11-29 06:56:53,895 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 06:56:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 977 transitions. [2023-11-29 06:56:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 06:56:53,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:53,895 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 06:56:53,901 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:54,096 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:54,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:54,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1652778409, now seen corresponding path program 1 times [2023-11-29 06:56:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:54,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945465208] [2023-11-29 06:56:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:56:54,097 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 06:56:54,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:54,098 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:54,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:56:54,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:56:54,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:54,432 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 06:56:54,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:56:54,494 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 06:56:54,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945465208] [2023-11-29 06:56:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945465208] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:56:54,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:56:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 06:56:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891317542] [2023-11-29 06:56:54,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:56:54,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:56:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:54,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:56:54,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:56:54,496 INFO L87 Difference]: Start difference. First operand 873 states and 977 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 06:56:55,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:55,911 INFO L93 Difference]: Finished difference Result 882 states and 991 transitions. [2023-11-29 06:56:55,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:56:55,912 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 06:56:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:55,916 INFO L225 Difference]: With dead ends: 882 [2023-11-29 06:56:55,916 INFO L226 Difference]: Without dead ends: 882 [2023-11-29 06:56:55,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:56:55,917 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 6 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3514 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:55,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3514 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 06:56:55,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2023-11-29 06:56:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 881. [2023-11-29 06:56:55,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 522 states have (on average 1.8409961685823755) internal successors, (961), 873 states have internal predecessors, (961), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 06:56:55,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 990 transitions. [2023-11-29 06:56:55,930 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 990 transitions. Word has length 65 [2023-11-29 06:56:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:55,931 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 990 transitions. [2023-11-29 06:56:55,931 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 06:56:55,931 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 990 transitions. [2023-11-29 06:56:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-29 06:56:55,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:55,932 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 06:56:55,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:56,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:56,132 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:56,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:56,133 INFO L85 PathProgramCache]: Analyzing trace with hash -676725449, now seen corresponding path program 2 times [2023-11-29 06:56:56,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693159137] [2023-11-29 06:56:56,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:56:56,133 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 06:56:56,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:56,134 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:56,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:56,559 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:56:56,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:56:56,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:56:56,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:56,612 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 06:56:56,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:56:56,751 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 06:56:56,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:56:56,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693159137] [2023-11-29 06:56:56,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693159137] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:56:56,751 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:56:56,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 06:56:56,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489600019] [2023-11-29 06:56:56,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:56:56,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:56:56,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:56:56,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:56:56,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:56:56,753 INFO L87 Difference]: Start difference. First operand 881 states and 990 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 06:56:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:56:58,856 INFO L93 Difference]: Finished difference Result 896 states and 1012 transitions. [2023-11-29 06:56:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:56:58,857 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 06:56:58,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:56:58,860 INFO L225 Difference]: With dead ends: 896 [2023-11-29 06:56:58,860 INFO L226 Difference]: Without dead ends: 894 [2023-11-29 06:56:58,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:56:58,861 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 12 mSDsluCounter, 4216 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4920 SdHoareTripleChecker+Invalid, 841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:56:58,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4920 Invalid, 841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 06:56:58,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2023-11-29 06:56:58,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 890. [2023-11-29 06:56:58,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 531 states have (on average 1.832391713747646) internal successors, (973), 882 states have internal predecessors, (973), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 06:56:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1002 transitions. [2023-11-29 06:56:58,874 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1002 transitions. Word has length 68 [2023-11-29 06:56:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:56:58,874 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1002 transitions. [2023-11-29 06:56:58,874 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 06:56:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1002 transitions. [2023-11-29 06:56:58,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 06:56:58,875 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:56:58,875 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 06:56:58,880 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:59,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:59,075 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:56:59,076 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:56:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1928775671, now seen corresponding path program 3 times [2023-11-29 06:56:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:56:59,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450385265] [2023-11-29 06:56:59,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:56:59,077 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 06:56:59,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:56:59,077 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:59,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:56:59,701 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 06:56:59,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:56:59,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:56:59,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:56:59,826 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 06:56:59,826 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:57:00,401 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 06:57:00,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:57:00,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450385265] [2023-11-29 06:57:00,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450385265] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:57:00,402 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:57:00,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 06:57:00,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333110749] [2023-11-29 06:57:00,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:57:00,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:57:00,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:57:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:57:00,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:57:00,404 INFO L87 Difference]: Start difference. First operand 890 states and 1002 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 06:57:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:06,090 INFO L93 Difference]: Finished difference Result 920 states and 1052 transitions. [2023-11-29 06:57:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 06:57:06,090 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 06:57:06,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:06,095 INFO L225 Difference]: With dead ends: 920 [2023-11-29 06:57:06,095 INFO L226 Difference]: Without dead ends: 917 [2023-11-29 06:57:06,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 06:57:06,097 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 24 mSDsluCounter, 9823 mSDsCounter, 0 mSdLazyCounter, 2127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 10526 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 2127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:06,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 10526 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 2127 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 06:57:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2023-11-29 06:57:06,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 908. [2023-11-29 06:57:06,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 908 states, 549 states have (on average 1.814207650273224) internal successors, (996), 900 states have internal predecessors, (996), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 06:57:06,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1025 transitions. [2023-11-29 06:57:06,113 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1025 transitions. Word has length 74 [2023-11-29 06:57:06,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:06,113 INFO L495 AbstractCegarLoop]: Abstraction has 908 states and 1025 transitions. [2023-11-29 06:57:06,113 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 06:57:06,114 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1025 transitions. [2023-11-29 06:57:06,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 06:57:06,114 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:06,114 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 06:57:06,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 06:57:06,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:57:06,315 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:57:06,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:06,315 INFO L85 PathProgramCache]: Analyzing trace with hash 191049079, now seen corresponding path program 4 times [2023-11-29 06:57:06,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:57:06,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104370210] [2023-11-29 06:57:06,316 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:57:06,316 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:57:06,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:57:06,317 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:57:06,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:57:06,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:57:06,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:57:06,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:57:06,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:06,976 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 06:57:06,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:57:08,439 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 06:57:08,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:57:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104370210] [2023-11-29 06:57:08,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104370210] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:57:08,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:57:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 06:57:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835750129] [2023-11-29 06:57:08,440 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:57:08,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 06:57:08,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:57:08,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 06:57:08,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 06:57:08,443 INFO L87 Difference]: Start difference. First operand 908 states and 1025 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 06:57:21,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:57:21,360 INFO L93 Difference]: Finished difference Result 965 states and 1114 transitions. [2023-11-29 06:57:21,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 06:57:21,361 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 06:57:21,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:57:21,365 INFO L225 Difference]: With dead ends: 965 [2023-11-29 06:57:21,365 INFO L226 Difference]: Without dead ends: 963 [2023-11-29 06:57:21,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 06:57:21,369 INFO L413 NwaCegarLoop]: 704 mSDtfsCounter, 48 mSDsluCounter, 16169 mSDsCounter, 0 mSdLazyCounter, 4601 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 16873 SdHoareTripleChecker+Invalid, 4649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 4601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:57:21,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 16873 Invalid, 4649 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 4601 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 06:57:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2023-11-29 06:57:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 942. [2023-11-29 06:57:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 583 states have (on average 1.7873070325900515) internal successors, (1042), 934 states have internal predecessors, (1042), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 06:57:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1071 transitions. [2023-11-29 06:57:21,383 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1071 transitions. Word has length 86 [2023-11-29 06:57:21,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:57:21,383 INFO L495 AbstractCegarLoop]: Abstraction has 942 states and 1071 transitions. [2023-11-29 06:57:21,383 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 06:57:21,384 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1071 transitions. [2023-11-29 06:57:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 06:57:21,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:57:21,384 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 06:57:21,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:57:21,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:57:21,585 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:57:21,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:57:21,585 INFO L85 PathProgramCache]: Analyzing trace with hash 345569847, now seen corresponding path program 5 times [2023-11-29 06:57:21,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:57:21,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074572855] [2023-11-29 06:57:21,586 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:57:21,586 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 06:57:21,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:57:21,587 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:57:21,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 06:57:22,956 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:57:22,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:57:22,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 06:57:22,992 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:57:22,997 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 06:57:23,103 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:57:23,103 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 06:57:23,129 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 06:57:23,224 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 06:57:24,130 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:57:24,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:57:24,168 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 06:57:24,195 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 06:57:24,196 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:57:28,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:57:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074572855] [2023-11-29 06:57:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074572855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:57:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1158376423] [2023-11-29 06:57:28,636 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:57:28,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:57:28,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:57:28,638 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:57:28,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-11-29 06:58:37,223 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:58:37,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:58:37,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 06:58:37,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:58:37,444 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 06:58:37,793 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:58:37,794 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 06:58:37,859 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 06:58:38,038 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 06:58:39,143 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:58:39,143 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 06:58:39,249 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 06:58:39,259 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 06:58:39,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:58:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1158376423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:58:40,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:58:40,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-11-29 06:58:40,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192336290] [2023-11-29 06:58:40,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:58:40,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 06:58:40,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:58:40,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 06:58:40,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=184, Unknown=3, NotChecked=0, Total=240 [2023-11-29 06:58:40,799 INFO L87 Difference]: Start difference. First operand 942 states and 1071 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 06:58:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:58:48,784 INFO L93 Difference]: Finished difference Result 1171 states and 1378 transitions. [2023-11-29 06:58:48,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:58:48,785 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 06:58:48,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:58:48,791 INFO L225 Difference]: With dead ends: 1171 [2023-11-29 06:58:48,791 INFO L226 Difference]: Without dead ends: 1169 [2023-11-29 06:58:48,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 204 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=62, Invalid=207, Unknown=3, NotChecked=0, Total=272 [2023-11-29 06:58:48,792 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 517 mSDsluCounter, 2603 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:58:48,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 3083 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-11-29 06:58:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-11-29 06:58:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 941. [2023-11-29 06:58:48,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 941 states, 583 states have (on average 1.7787307032590052) internal successors, (1037), 933 states have internal predecessors, (1037), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 06:58:48,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 941 states to 941 states and 1066 transitions. [2023-11-29 06:58:48,808 INFO L78 Accepts]: Start accepts. Automaton has 941 states and 1066 transitions. Word has length 108 [2023-11-29 06:58:48,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:58:48,808 INFO L495 AbstractCegarLoop]: Abstraction has 941 states and 1066 transitions. [2023-11-29 06:58:48,808 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 06:58:48,808 INFO L276 IsEmpty]: Start isEmpty. Operand 941 states and 1066 transitions. [2023-11-29 06:58:48,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 06:58:48,809 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:58:48,809 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 06:58:48,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 06:58:49,038 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2023-11-29 06:58:49,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:58:49,210 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 06:58:49,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:58:49,210 INFO L85 PathProgramCache]: Analyzing trace with hash 345569848, now seen corresponding path program 1 times [2023-11-29 06:58:49,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:58:49,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1305635956] [2023-11-29 06:58:49,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:49,211 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 06:58:49,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:58:49,212 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:58:49,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 06:58:49,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:58:49,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 06:58:49,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:58:49,898 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 06:58:50,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 5 [2023-11-29 06:58:50,234 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:58:50,234 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 06:58:50,269 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 06:58:50,283 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 06:58:50,435 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 06:58:50,442 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 06:58:51,266 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:58:51,266 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 06:58:51,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 06:58:51,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 25 treesize of output 13 [2023-11-29 06:58:51,354 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 06:58:51,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 06:58:51,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:58:52,882 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3011 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3010 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3011) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3010) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:58:52,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:58:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1305635956] [2023-11-29 06:58:52,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1305635956] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:58:52,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [261671083] [2023-11-29 06:58:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:58:52,890 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:58:52,890 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:58:52,891 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:58:52,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-11-29 07:00:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:35,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 07:00:35,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:35,455 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 07:00:35,805 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:00:35,805 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 07:00:35,813 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 07:00:35,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 07:00:35,842 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 07:00:35,919 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 07:00:35,924 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 07:00:36,747 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:00:36,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 07:00:36,757 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 07:00:36,826 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 07:00:36,834 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 07:00:36,840 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 07:00:36,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:38,227 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3565 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3565) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_3564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:00:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [261671083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:38,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:00:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 07:00:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508563452] [2023-11-29 07:00:38,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:00:38,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 07:00:38,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:00:38,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 07:00:38,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 07:00:38,234 INFO L87 Difference]: Start difference. First operand 941 states and 1066 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 07:00:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:00:48,345 INFO L93 Difference]: Finished difference Result 1168 states and 1373 transitions. [2023-11-29 07:00:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 07:00:48,346 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 07:00:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:00:48,350 INFO L225 Difference]: With dead ends: 1168 [2023-11-29 07:00:48,350 INFO L226 Difference]: Without dead ends: 1168 [2023-11-29 07:00:48,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 07:00:48,351 INFO L413 NwaCegarLoop]: 505 mSDtfsCounter, 471 mSDsluCounter, 1918 mSDsCounter, 0 mSdLazyCounter, 3630 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 2423 SdHoareTripleChecker+Invalid, 3637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2023-11-29 07:00:48,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 2423 Invalid, 3637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3630 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2023-11-29 07:00:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-11-29 07:00:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 940. [2023-11-29 07:00:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 583 states have (on average 1.777015437392796) internal successors, (1036), 932 states have internal predecessors, (1036), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:00:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1065 transitions. [2023-11-29 07:00:48,363 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1065 transitions. Word has length 108 [2023-11-29 07:00:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:00:48,364 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1065 transitions. [2023-11-29 07:00:48,364 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 07:00:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1065 transitions. [2023-11-29 07:00:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 07:00:48,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:00:48,365 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 07:00:48,374 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 07:00:48,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-11-29 07:00:48,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:00:48,766 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:00:48,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:00:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1381544227, now seen corresponding path program 1 times [2023-11-29 07:00:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:00:48,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710089427] [2023-11-29 07:00:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 07:00:48,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:00:48,769 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:00:48,770 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 07:00:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:49,531 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 07:00:49,539 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:49,542 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 07:00:49,654 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:00:49,654 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 07:00:49,679 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 07:00:49,770 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 07:00:50,658 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:00:50,659 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 07:00:50,765 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:00:50,765 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 07:00:50,777 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 07:00:50,811 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 07:00:50,812 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:00:54,923 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3989 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3989) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:00:55,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:00:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710089427] [2023-11-29 07:00:55,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710089427] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:00:55,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1657574777] [2023-11-29 07:00:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:00:55,358 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:00:55,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:00:55,359 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:00:55,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-11-29 07:00:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:00:59,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 07:00:59,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:00:59,319 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 07:00:59,713 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:00:59,714 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 07:00:59,794 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 07:00:59,993 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 07:01:00,745 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:00,745 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 07:01:00,898 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:00,899 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 07:01:00,913 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 07:01:00,923 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 07:01:00,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:01:00,938 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4460) |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 07:01:00,948 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4460 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4460) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 07:01:01,343 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4460 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_4506))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4460)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:01:01,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1657574777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:01:01,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:01:01,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 07:01:01,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636426464] [2023-11-29 07:01:01,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:01:01,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 07:01:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 07:01:01,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=272, Unknown=8, NotChecked=148, Total=506 [2023-11-29 07:01:01,347 INFO L87 Difference]: Start difference. First operand 940 states and 1065 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 07:01:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:10,282 INFO L93 Difference]: Finished difference Result 1167 states and 1372 transitions. [2023-11-29 07:01:10,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:01:10,283 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 07:01:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:10,286 INFO L225 Difference]: With dead ends: 1167 [2023-11-29 07:01:10,286 INFO L226 Difference]: Without dead ends: 1167 [2023-11-29 07:01:10,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 206 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=87, Invalid=301, Unknown=8, NotChecked=156, Total=552 [2023-11-29 07:01:10,287 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 512 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 3370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 3188 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 3370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:10,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 3188 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 3370 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 07:01:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2023-11-29 07:01:10,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 939. [2023-11-29 07:01:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 583 states have (on average 1.7753001715265866) internal successors, (1035), 931 states have internal predecessors, (1035), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:01:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1064 transitions. [2023-11-29 07:01:10,299 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1064 transitions. Word has length 110 [2023-11-29 07:01:10,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:10,300 INFO L495 AbstractCegarLoop]: Abstraction has 939 states and 1064 transitions. [2023-11-29 07:01:10,300 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 07:01:10,300 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1064 transitions. [2023-11-29 07:01:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 07:01:10,301 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:10,301 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 07:01:10,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-11-29 07:01:10,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-11-29 07:01:10,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:01:10,702 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:01:10,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:10,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1381544228, now seen corresponding path program 1 times [2023-11-29 07:01:10,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:10,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860021647] [2023-11-29 07:01:10,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:10,703 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 07:01:10,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:10,704 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:01:10,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-29 07:01:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:11,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 07:01:11,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:11,556 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 07:01:11,845 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 07:01:11,860 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:01:11,860 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 07:01:11,887 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 07:01:11,896 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 07:01:12,011 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 07:01:12,017 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 07:01:12,737 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:12,737 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 07:01:12,743 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 07:01:12,872 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:12,872 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 07:01:12,878 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 07:01:12,901 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 07:01:12,906 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 07:01:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 07:01:12,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:01:13,115 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_4975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:01:13,149 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_4976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_4975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 07:01:14,745 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5067) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5068) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4976 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5068 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5068))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5067) .cse2 v_ArrVal_4976) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 07:01:14,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:14,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860021647] [2023-11-29 07:01:14,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860021647] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:01:14,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1893658929] [2023-11-29 07:01:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:14,755 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:01:14,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:01:14,756 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:01:14,756 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-11-29 07:01:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:18,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 07:01:18,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:19,001 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 07:01:19,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:01:19,270 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 07:01:19,276 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 07:01:19,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 07:01:19,317 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 07:01:19,379 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 07:01:19,383 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 07:01:20,023 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:20,023 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 07:01:20,033 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 07:01:20,124 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:20,125 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 07:01:20,133 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 07:01:20,145 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 07:01:20,149 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 07:01:20,155 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 07:01:20,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:01:20,199 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_5538) |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 07:01:20,240 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_5538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_5537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 07:01:21,548 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5629) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5629 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5537 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5538 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5630))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_5629) .cse2 v_ArrVal_5538) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5537) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 07:01:21,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1893658929] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:01:21,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:01:21,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 07:01:21,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195833780] [2023-11-29 07:01:21,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:01:21,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 07:01:21,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 07:01:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 07:01:21,567 INFO L87 Difference]: Start difference. First operand 939 states and 1064 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 07:01:30,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:01:30,357 INFO L93 Difference]: Finished difference Result 1166 states and 1371 transitions. [2023-11-29 07:01:30,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 07:01:30,358 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 07:01:30,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:01:30,361 INFO L225 Difference]: With dead ends: 1166 [2023-11-29 07:01:30,361 INFO L226 Difference]: Without dead ends: 1166 [2023-11-29 07:01:30,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 211 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 07:01:30,362 INFO L413 NwaCegarLoop]: 504 mSDtfsCounter, 469 mSDsluCounter, 1644 mSDsCounter, 0 mSdLazyCounter, 3115 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 2148 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 3115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 07:01:30,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 2148 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 3115 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 07:01:30,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2023-11-29 07:01:30,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 938. [2023-11-29 07:01:30,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 583 states have (on average 1.7735849056603774) internal successors, (1034), 930 states have internal predecessors, (1034), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:01:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1063 transitions. [2023-11-29 07:01:30,374 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1063 transitions. Word has length 110 [2023-11-29 07:01:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:01:30,374 INFO L495 AbstractCegarLoop]: Abstraction has 938 states and 1063 transitions. [2023-11-29 07:01:30,374 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 07:01:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1063 transitions. [2023-11-29 07:01:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 07:01:30,375 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:01:30,375 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 07:01:30,386 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Ended with exit code 0 [2023-11-29 07:01:30,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-11-29 07:01:30,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:01:30,776 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:01:30,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:01:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash 520506154, now seen corresponding path program 1 times [2023-11-29 07:01:30,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:01:30,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319072643] [2023-11-29 07:01:30,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:30,777 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 07:01:30,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:01:30,778 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:01:30,779 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-29 07:01:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:31,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 07:01:31,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:31,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 07:01:31,873 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:01:31,874 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 07:01:31,911 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 07:01:32,031 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 07:01:33,076 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:01:33,077 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 07:01:33,213 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:01:33,213 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 07:01:33,308 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:01:33,308 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 07:01:33,323 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 07:01:33,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 07:01:33,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:01:33,438 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6070) |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 07:01:33,452 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6070 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6070) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:01:33,469 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6069 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6069))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6070)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:01:33,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6069 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6069))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6070)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:01:33,888 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6070 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6116 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6069 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6116))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6069)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6070)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:01:33,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:01:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319072643] [2023-11-29 07:01:33,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319072643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:01:33,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [469465128] [2023-11-29 07:01:33,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:01:33,892 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:01:33,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:01:33,893 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:01:33,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-11-29 07:01:50,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:01:50,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 07:01:50,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:01:50,677 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 07:01:51,031 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:01:51,032 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 07:01:51,095 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 07:01:51,265 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 07:01:52,207 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:52,207 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 07:01:52,389 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:52,390 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 07:01:52,493 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:01:52,493 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 07:01:52,512 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 07:01:52,522 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 07:01:52,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:01:52,538 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_6557) |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 07:01:52,551 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6557 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6557) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:01:52,565 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6557 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_6556))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6557)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:01:52,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6557 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6556))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6557)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:01:52,997 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6603 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6556 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6557 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_6603))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6556)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6557)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:01:53,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [469465128] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:01:53,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:01:53,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 07:01:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263949948] [2023-11-29 07:01:53,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:01:53,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 07:01:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:01:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 07:01:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=277, Unknown=10, NotChecked=430, Total=812 [2023-11-29 07:01:53,003 INFO L87 Difference]: Start difference. First operand 938 states and 1063 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 07:02:05,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:02:05,192 INFO L93 Difference]: Finished difference Result 1165 states and 1370 transitions. [2023-11-29 07:02:05,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 07:02:05,193 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 07:02:05,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:02:05,196 INFO L225 Difference]: With dead ends: 1165 [2023-11-29 07:02:05,196 INFO L226 Difference]: Without dead ends: 1165 [2023-11-29 07:02:05,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 208 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=306, Unknown=10, NotChecked=450, Total=870 [2023-11-29 07:02:05,197 INFO L413 NwaCegarLoop]: 478 mSDtfsCounter, 508 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 5248 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 4735 SdHoareTripleChecker+Invalid, 5254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-11-29 07:02:05,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 4735 Invalid, 5254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5248 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-11-29 07:02:05,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2023-11-29 07:02:05,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 937. [2023-11-29 07:02:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 583 states have (on average 1.771869639794168) internal successors, (1033), 929 states have internal predecessors, (1033), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:02:05,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1062 transitions. [2023-11-29 07:02:05,211 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1062 transitions. Word has length 112 [2023-11-29 07:02:05,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:02:05,211 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1062 transitions. [2023-11-29 07:02:05,211 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 07:02:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1062 transitions. [2023-11-29 07:02:05,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 07:02:05,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:02:05,212 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 07:02:05,240 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-11-29 07:02:05,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Ended with exit code 0 [2023-11-29 07:02:05,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:02:05,613 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:02:05,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:02:05,613 INFO L85 PathProgramCache]: Analyzing trace with hash 520506155, now seen corresponding path program 1 times [2023-11-29 07:02:05,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:02:05,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223051531] [2023-11-29 07:02:05,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:05,614 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 07:02:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:02:05,615 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:02:05,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-11-29 07:02:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:06,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 07:02:06,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:06,631 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 07:02:06,982 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:02:06,982 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 07:02:06,991 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 07:02:07,027 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 07:02:07,036 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 07:02:07,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 07:02:07,177 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 07:02:07,911 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:07,911 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 07:02:07,919 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 07:02:08,051 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:08,052 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 07:02:08,058 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 07:02:08,174 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:08,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 07:02:08,184 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 07:02:08,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 07:02:08,219 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 07:02:08,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 07:02:08,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:08,430 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:02:08,474 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 07:02:08,601 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7088))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7087) .cse0 v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7087) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 07:02:08,717 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7088))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7087) .cse1 v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7090) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7087 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7088 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7089 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7087) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7088) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7089) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 07:02:16,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:02:16,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223051531] [2023-11-29 07:02:16,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1223051531] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:02:16,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1572372482] [2023-11-29 07:02:16,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:02:16,693 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:02:16,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:02:16,694 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:02:16,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-11-29 07:02:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:02:33,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 857 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 07:02:33,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:02:33,462 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 07:02:34,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 5 [2023-11-29 07:02:34,248 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:02:34,248 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 07:02:34,286 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 07:02:34,311 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 07:02:34,462 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 07:02:34,472 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 07:02:36,046 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:36,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 07:02:36,063 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 07:02:36,247 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:36,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 07:02:36,265 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 07:02:36,381 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:02:36,381 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 07:02:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 07:02:36,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 07:02:36,454 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 07:02:36,456 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 07:02:36,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:02:36,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7668 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7669) |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 07:02:36,603 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7668 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_7668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 07:02:36,667 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7667))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7666) .cse0 v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7666) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_7667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7669) |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 07:02:36,736 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7667))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7666) .cse1 v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_7666) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_7667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 07:02:38,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7761))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7667))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7760) .cse0 v_ArrVal_7666) .cse1 v_ArrVal_7669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7761 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7760 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7761))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7760) .cse6 v_ArrVal_7666) (select (select (store .cse7 .cse6 v_ArrVal_7667) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7669))) |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 07:02:38,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1572372482] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:02:38,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:02:38,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 07:02:38,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756573683] [2023-11-29 07:02:38,567 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:02:38,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 07:02:38,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:02:38,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 07:02:38,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=148, Unknown=17, NotChecked=288, Total=506 [2023-11-29 07:02:38,568 INFO L87 Difference]: Start difference. First operand 937 states and 1062 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 07:03:01,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:03:01,331 INFO L93 Difference]: Finished difference Result 1164 states and 1369 transitions. [2023-11-29 07:03:01,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 07:03:01,332 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 07:03:01,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:03:01,336 INFO L225 Difference]: With dead ends: 1164 [2023-11-29 07:03:01,336 INFO L226 Difference]: Without dead ends: 1164 [2023-11-29 07:03:01,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 214 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=92, Invalid=304, Unknown=20, NotChecked=396, Total=812 [2023-11-29 07:03:01,337 INFO L413 NwaCegarLoop]: 504 mSDtfsCounter, 464 mSDsluCounter, 1922 mSDsCounter, 0 mSdLazyCounter, 3619 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 2426 SdHoareTripleChecker+Invalid, 3625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 3619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2023-11-29 07:03:01,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 2426 Invalid, 3625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 3619 Invalid, 0 Unknown, 0 Unchecked, 18.8s Time] [2023-11-29 07:03:01,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2023-11-29 07:03:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 936. [2023-11-29 07:03:01,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 583 states have (on average 1.7701543739279588) internal successors, (1032), 928 states have internal predecessors, (1032), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:03:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1061 transitions. [2023-11-29 07:03:01,355 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1061 transitions. Word has length 112 [2023-11-29 07:03:01,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:03:01,355 INFO L495 AbstractCegarLoop]: Abstraction has 936 states and 1061 transitions. [2023-11-29 07:03:01,355 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 07:03:01,355 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1061 transitions. [2023-11-29 07:03:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 07:03:01,356 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:03:01,356 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 07:03:01,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 07:03:01,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-11-29 07:03:01,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:03:01,757 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:03:01,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:03:01,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1991600587, now seen corresponding path program 1 times [2023-11-29 07:03:01,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:03:01,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894250915] [2023-11-29 07:03:01,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:01,758 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 07:03:01,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:03:01,759 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:03:01,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 07:03:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:02,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 07:03:02,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:02,912 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 07:03:03,346 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:03:03,346 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 07:03:03,417 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 07:03:03,659 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 07:03:05,644 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:05,644 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 07:03:05,902 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:05,902 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 07:03:06,116 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:06,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 07:03:06,336 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:06,337 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 07:03:06,364 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 07:03:06,483 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 07:03:06,483 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:03:10,848 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8217 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8217) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:03:10,880 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8216))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:03:10,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8216))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:03:10,946 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8215 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8215))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8216)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:03:10,981 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8215 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8215))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8216)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:03:11,684 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8263 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8216 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8215 (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8263))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8215)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8216)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8217)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:03:11,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:03:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894250915] [2023-11-29 07:03:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894250915] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:03:11,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1075556448] [2023-11-29 07:03:11,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:11,692 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:03:11,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:03:11,693 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:03:11,694 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-11-29 07:03:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:32,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 07:03:32,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:32,425 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 07:03:33,255 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:03:33,255 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 07:03:33,390 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 07:03:33,832 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 07:03:35,774 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:03:35,774 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 07:03:36,221 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:03:36,221 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 07:03:36,506 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:03:36,506 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 07:03:36,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:03:36,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 07:03:36,825 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 07:03:36,849 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 07:03:36,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:03:36,888 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_8720) |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 07:03:36,917 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8720 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8720) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-11-29 07:03:36,953 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8720 (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$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8719))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8720)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:03:36,986 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8720 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8719))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8720)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:03:37,022 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8720 (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_8718))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8719)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8720)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:03:37,060 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8720 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8718))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8719)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8720)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 07:03:37,788 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8719 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8766 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8720 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8766))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8718)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8719)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8720)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 07:03:37,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1075556448] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:03:37,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:03:37,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 07:03:37,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694463930] [2023-11-29 07:03:37,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:03:37,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 07:03:37,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:03:37,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 07:03:37,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=382, Unknown=14, NotChecked=676, Total=1190 [2023-11-29 07:03:37,798 INFO L87 Difference]: Start difference. First operand 936 states and 1061 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 07:03:52,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:03:52,054 INFO L93 Difference]: Finished difference Result 1163 states and 1368 transitions. [2023-11-29 07:03:52,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 07:03:52,055 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 07:03:52,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:03:52,059 INFO L225 Difference]: With dead ends: 1163 [2023-11-29 07:03:52,059 INFO L226 Difference]: Without dead ends: 1163 [2023-11-29 07:03:52,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=127, Invalid=417, Unknown=14, NotChecked=702, Total=1260 [2023-11-29 07:03:52,060 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 951 mSDsluCounter, 2060 mSDsCounter, 0 mSdLazyCounter, 2774 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:03:52,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2537 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2774 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2023-11-29 07:03:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2023-11-29 07:03:52,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 935. [2023-11-29 07:03:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 583 states have (on average 1.7684391080617496) internal successors, (1031), 927 states have internal predecessors, (1031), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:03:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1060 transitions. [2023-11-29 07:03:52,087 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1060 transitions. Word has length 114 [2023-11-29 07:03:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:03:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1060 transitions. [2023-11-29 07:03:52,087 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 07:03:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1060 transitions. [2023-11-29 07:03:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-11-29 07:03:52,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:03:52,089 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 07:03:52,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 07:03:52,316 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2023-11-29 07:03:52,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:03:52,489 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:03:52,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:03:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1991600588, now seen corresponding path program 1 times [2023-11-29 07:03:52,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:03:52,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224189976] [2023-11-29 07:03:52,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:03:52,490 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 07:03:52,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:03:52,491 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:03:52,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Waiting until timeout for monitored process [2023-11-29 07:03:53,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:03:53,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 07:03:53,679 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:03:53,685 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 07:03:54,053 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:03:54,054 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 07:03:54,069 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 07:03:54,134 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 07:03:54,171 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 07:03:54,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 07:03:54,445 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 07:03:56,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:56,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 07:03:56,115 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 07:03:56,384 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:56,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 07:03:56,413 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 07:03:56,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:56,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 07:03:56,623 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 07:03:56,849 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:03:56,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 62 treesize of output 57 [2023-11-29 07:03:56,869 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 07:03:56,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 07:03:56,925 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 07:03:57,009 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 07:03:57,009 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:03:57,320 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 07:03:57,376 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 07:03:57,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9268) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9267))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9268) .cse2 v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 07:03:57,670 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9268) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_9267))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_9268) .cse3 v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 07:04:01,776 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9266))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9267))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9265) .cse1 v_ArrVal_9268) .cse2 v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9266))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9265) .cse7 v_ArrVal_9268) (select (select (store .cse8 .cse7 v_ArrVal_9267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9269))) |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 07:04:07,862 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9362))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_9266))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9361) .cse1 v_ArrVal_9265) .cse2 v_ArrVal_9268) (select (select (store .cse3 .cse2 v_ArrVal_9267) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9269))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9266 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9265 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9269 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9268 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9267 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9362))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_9266))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_9267))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9361) .cse6 v_ArrVal_9265) .cse7 v_ArrVal_9268) .cse8 v_ArrVal_9269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_9270) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 07:04:07,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:04:07,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224189976] [2023-11-29 07:04:07,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224189976] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:04:07,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2111631819] [2023-11-29 07:04:07,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:04:07,899 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:04:07,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:04:07,900 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:04:07,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2023-11-29 07:04:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:04:31,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-29 07:04:31,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:04:31,222 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 07:04:33,340 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 07:04:33,460 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 07:04:33,461 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 07:04:33,810 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 07:04:33,865 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 07:04:34,870 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 07:04:34,891 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 07:04:38,643 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:04:38,643 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 07:04:38,684 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 07:04:39,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:04:39,626 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 07:04:39,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 07:04:40,312 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:04:40,312 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 07:04:40,353 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 07:04:41,015 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:04:41,015 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 07:04:41,055 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 07:04:41,142 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 07:04:41,181 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 07:04:41,201 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 07:04:41,201 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:04:41,375 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9866) |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 07:04:41,472 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 07:04:41,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9864) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9865))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9864) .cse2 v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 07:04:48,607 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9863))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9862) .cse1 v_ArrVal_9864) (select (select (store .cse2 .cse1 v_ArrVal_9865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9866))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9863))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9865))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_9862) .cse4 v_ArrVal_9864) .cse5 v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 07:04:49,572 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9863))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9865))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9862) .cse1 v_ArrVal_9864) .cse2 v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_9863))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_9862) .cse7 v_ArrVal_9864) (select (select (store .cse8 .cse7 v_ArrVal_9865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9866))) |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 07:04:57,485 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9867 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9958))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9863))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9865))) (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$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9959) .cse0 v_ArrVal_9862) .cse1 v_ArrVal_9864) .cse2 v_ArrVal_9866) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9867) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9959 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9958 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9866 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9865 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9864 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9863 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9958))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9863))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9959) .cse8 v_ArrVal_9862) .cse9 v_ArrVal_9864) (select (select (store .cse10 .cse9 v_ArrVal_9865) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9866))))) |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 07:04:57,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2111631819] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:04:57,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:04:57,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 07:04:57,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270941409] [2023-11-29 07:04:57,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:04:57,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 07:04:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:04:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 07:04:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=421, Unknown=23, NotChecked=636, Total=1190 [2023-11-29 07:04:57,526 INFO L87 Difference]: Start difference. First operand 935 states and 1060 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 07:05:57,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:05:57,907 INFO L93 Difference]: Finished difference Result 1162 states and 1367 transitions. [2023-11-29 07:05:57,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 07:05:57,908 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 07:05:57,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:05:57,911 INFO L225 Difference]: With dead ends: 1162 [2023-11-29 07:05:57,911 INFO L226 Difference]: Without dead ends: 1162 [2023-11-29 07:05:57,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 210 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=180, Invalid=715, Unknown=23, NotChecked=804, Total=1722 [2023-11-29 07:05:57,912 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 511 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 3404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 3414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.6s IncrementalHoareTripleChecker+Time [2023-11-29 07:05:57,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 2278 Invalid, 3414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3404 Invalid, 0 Unknown, 0 Unchecked, 57.6s Time] [2023-11-29 07:05:57,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2023-11-29 07:05:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 934. [2023-11-29 07:05:57,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 583 states have (on average 1.7667238421955402) internal successors, (1030), 926 states have internal predecessors, (1030), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:05:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1059 transitions. [2023-11-29 07:05:57,925 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1059 transitions. Word has length 114 [2023-11-29 07:05:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:05:57,925 INFO L495 AbstractCegarLoop]: Abstraction has 934 states and 1059 transitions. [2023-11-29 07:05:57,926 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 07:05:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1059 transitions. [2023-11-29 07:05:57,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 07:05:57,926 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:05:57,926 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 07:05:57,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Ended with exit code 0 [2023-11-29 07:05:58,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2023-11-29 07:05:58,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:05:58,327 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:05:58,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:05:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1625817230, now seen corresponding path program 1 times [2023-11-29 07:05:58,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:05:58,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367861451] [2023-11-29 07:05:58,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:05:58,328 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 07:05:58,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:05:58,329 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:05:58,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-11-29 07:05:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:05:59,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 07:05:59,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:05:59,758 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 07:06:01,709 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:06:01,709 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 07:06:01,976 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 07:06:02,840 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 07:06:10,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:06:10,043 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 07:06:11,017 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:06:11,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 07:06:11,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:06:11,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 07:06:12,495 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:06:12,496 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 07:06:13,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:06:13,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 07:06:13,426 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 07:06:13,990 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 07:06:13,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 07:06:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 07:06:14,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:15,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_10433) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:15,451 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10433) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:15,569 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10432))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 07:06:15,685 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 07:06:15,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10431))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:15,927 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10431))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 07:06:16,052 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10430))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10431)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 07:06:16,181 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10430))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10431)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:18,293 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10432 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10433 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10431 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (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$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10480))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10430)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10431)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10432)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10433)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 07:06:18,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:06:18,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367861451] [2023-11-29 07:06:18,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367861451] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:18,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [244531380] [2023-11-29 07:06:18,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:06:18,316 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:06:18,316 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:06:18,317 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:06:18,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-11-29 07:06:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:06:25,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 07:06:25,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:06:25,735 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 07:06:29,475 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:06:29,475 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 07:06:30,067 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 07:06:31,645 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 07:06:41,279 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:06:41,279 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 07:06:42,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:06:42,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 07:06:43,829 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:06:43,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 36 treesize of output 35 [2023-11-29 07:06:45,007 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:06:45,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 07:06:46,146 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:06:46,146 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 07:06:46,260 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 07:06:46,859 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-29 07:06:46,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2023-11-29 07:06:46,959 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 07:06:46,959 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:06:48,611 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 07:06:48,733 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10953))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 07:06:48,856 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10953))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 07:06:48,984 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10952))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10953)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:49,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10952))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10953)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:49,241 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (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$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_10951))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10952)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10953)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2023-11-29 07:06:49,371 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10953 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10954 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10951 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10952 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10434 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc45#1.base_16| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16| v_ArrVal_10434) (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10951))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10952)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10953)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10954)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_16|) (_ bv0 1))))) is different from false [2023-11-29 07:06:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [244531380] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:06:52,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:06:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-11-29 07:06:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238527798] [2023-11-29 07:06:52,219 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:06:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 07:06:52,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:06:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 07:06:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=593, Unknown=24, NotChecked=1040, Total=1806 [2023-11-29 07:06:52,222 INFO L87 Difference]: Start difference. First operand 934 states and 1059 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 07:08:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 07:08:20,973 INFO L93 Difference]: Finished difference Result 1161 states and 1366 transitions. [2023-11-29 07:08:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 07:08:20,974 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 07:08:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 07:08:20,977 INFO L225 Difference]: With dead ends: 1161 [2023-11-29 07:08:20,978 INFO L226 Difference]: Without dead ends: 1161 [2023-11-29 07:08:20,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 209 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=158, Invalid=637, Unknown=25, NotChecked=1072, Total=1892 [2023-11-29 07:08:20,979 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 498 mSDsluCounter, 4328 mSDsCounter, 0 mSdLazyCounter, 5379 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 4804 SdHoareTripleChecker+Invalid, 5387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 88.1s IncrementalHoareTripleChecker+Time [2023-11-29 07:08:20,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 4804 Invalid, 5387 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8 Valid, 5379 Invalid, 0 Unknown, 0 Unchecked, 88.1s Time] [2023-11-29 07:08:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2023-11-29 07:08:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 933. [2023-11-29 07:08:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 583 states have (on average 1.765008576329331) internal successors, (1029), 925 states have internal predecessors, (1029), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2023-11-29 07:08:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1058 transitions. [2023-11-29 07:08:20,993 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1058 transitions. Word has length 116 [2023-11-29 07:08:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 07:08:20,994 INFO L495 AbstractCegarLoop]: Abstraction has 933 states and 1058 transitions. [2023-11-29 07:08:20,994 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 07:08:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1058 transitions. [2023-11-29 07:08:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-29 07:08:20,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 07:08:20,994 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 07:08:21,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-11-29 07:08:21,213 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-11-29 07:08:21,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 07:08:21,395 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 532 more)] === [2023-11-29 07:08:21,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 07:08:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1625817229, now seen corresponding path program 1 times [2023-11-29 07:08:21,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 07:08:21,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735490717] [2023-11-29 07:08:21,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:08:21,396 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 07:08:21,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 07:08:21,397 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 07:08:21,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2023-11-29 07:08:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:08:22,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 07:08:22,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:08:22,806 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 07:08:24,603 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:08:24,603 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 07:08:24,723 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 07:08:25,044 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 07:08:25,201 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 07:08:26,282 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 07:08:26,314 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 07:08:37,255 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:08:37,255 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 07:08:37,290 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 07:08:38,525 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:08:38,525 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 07:08:38,649 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 07:08:39,498 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:08:39,499 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 07:08:39,533 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 07:08:40,507 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:08:40,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 07:08:40,604 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 07:08:41,569 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 07:08:41,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 68 [2023-11-29 07:08:41,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 07:08:41,780 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 44 treesize of output 20 [2023-11-29 07:08:41,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 07:08:41,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:08:41,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 07:08:42,190 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 07:08:42,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 07:08:42,499 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 07:08:42,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:08:49,237 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32))))))))) is different from false [2023-11-29 07:08:51,788 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11522))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11523) .cse1 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse3 .cse1 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11523) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse4 (bvadd .cse4 (_ bv4 32))))))))) is different from false [2023-11-29 07:08:59,723 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11521))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11522))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11520) .cse1 v_ArrVal_11523) .cse2 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse4 .cse2 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_11521))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_11520) .cse7 v_ArrVal_11523) (select (select (store .cse8 .cse7 v_ArrVal_11522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11524))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 07:08:59,974 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))) (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11519))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_11521))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_11522))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11518) .cse0 v_ArrVal_11520) .cse1 v_ArrVal_11523) .cse2 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse4 .cse2 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) (or (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11519))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11521))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_11518) .cse8 v_ArrVal_11520) .cse9 v_ArrVal_11523) (select (select (store .cse10 .cse9 v_ArrVal_11522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11524))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 07:09:00,702 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11519))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_11521))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11518) .cse2 v_ArrVal_11520) .cse3 v_ArrVal_11523) (select (select (store .cse4 .cse3 v_ArrVal_11522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11524))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_11519))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_11521))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_11522))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_11518) .cse7 v_ArrVal_11520) .cse8 v_ArrVal_11523) .cse9 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse10 .cse9 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 07:09:05,459 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32)) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11617))) (let ((.cse0 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse0 v_ArrVal_11519))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_11521))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_11522))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11618) .cse0 v_ArrVal_11518) .cse1 v_ArrVal_11520) .cse2 v_ArrVal_11523) .cse3 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse5 .cse3 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((v_ArrVal_11521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11523 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11519 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select (select (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11617))) (let ((.cse10 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse14 (store .cse15 .cse10 v_ArrVal_11519))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_11521))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_11618) .cse10 v_ArrVal_11518) .cse11 v_ArrVal_11520) .cse12 v_ArrVal_11523) (select (select (store .cse13 .cse12 v_ArrVal_11522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_11524))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule .cse9 (bvadd (_ bv4 32) .cse9)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 07:09:05,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 07:09:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735490717] [2023-11-29 07:09:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735490717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:09:05,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [766104626] [2023-11-29 07:09:05,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 07:09:05,508 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 07:09:05,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 07:09:05,509 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 07:09:05,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_052ca919-a1b9-4300-b4a9-8f2c3610b4a8/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2023-11-29 07:09:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 07:09:18,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 921 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-29 07:09:18,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 07:09:18,321 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 07:09:21,718 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 07:09:22,071 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 07:09:22,071 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 07:09:22,808 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 07:09:22,932 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 07:09:25,022 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 29 treesize of output 17 [2023-11-29 07:09:25,054 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 07:09:35,524 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:09:35,525 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 61 treesize of output 54 [2023-11-29 07:09:35,590 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 07:09:37,624 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:09:37,625 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 61 treesize of output 54 [2023-11-29 07:09:37,719 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 07:09:38,978 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:09:38,978 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 61 treesize of output 54 [2023-11-29 07:09:39,043 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 07:09:40,319 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:09:40,319 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 61 treesize of output 54 [2023-11-29 07:09:40,384 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 07:09:41,642 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 07:09:41,643 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 61 treesize of output 54 [2023-11-29 07:09:41,706 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 07:09:41,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2023-11-29 07:09:41,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 07:09:41,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 07:09:42,012 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 07:09:42,301 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 07:09:42,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-11-29 07:09:42,334 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 07:09:42,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 07:09:44,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12140) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32)))))) (forall ((v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12139))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_12140) .cse2 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse3 .cse2 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 07:10:06,580 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12138))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12139))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12137) .cse1 v_ArrVal_12140) .cse2 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse4 .cse2 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_12138))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_12137) .cse7 v_ArrVal_12140) (select (select (store .cse8 .cse7 v_ArrVal_12139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11524))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse6 (bvadd (_ bv4 32) .cse6)))))))) is different from false [2023-11-29 07:10:06,928 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12136))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12138))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12139))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12135) .cse0 v_ArrVal_12137) .cse1 v_ArrVal_12140) .cse2 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse4 .cse2 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))) (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12136))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12138))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem40#1.base| v_ArrVal_12135) .cse8 v_ArrVal_12137) .cse9 v_ArrVal_12140) (select (select (store .cse10 .cse9 v_ArrVal_12139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11524))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule .cse7 (bvadd (_ bv4 32) .cse7))))))) is different from false [2023-11-29 07:10:07,227 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (and (or (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12136))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_12138))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12135) .cse2 v_ArrVal_12137) .cse3 v_ArrVal_12140) (select (select (store .cse4 .cse3 v_ArrVal_12139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11524))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_12136))) (let ((.cse7 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse11 (store .cse12 .cse7 v_ArrVal_12138))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12139))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_12135) .cse7 v_ArrVal_12137) .cse8 v_ArrVal_12140) .cse9 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse10 .cse9 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|)))))))) is different from false [2023-11-29 07:10:12,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (or (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12234))) (let ((.cse1 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_12136))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_12138))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12235) .cse1 v_ArrVal_12135) .cse2 v_ArrVal_12137) .cse3 v_ArrVal_12140) (select (select (store .cse4 .cse3 v_ArrVal_12139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) v_ArrVal_11524))))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))) (forall ((v_ArrVal_12137 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12135 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12136 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11525 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11524 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12140 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc45#1.base_18| (_ BitVec 32))) (or (forall ((v_ArrVal_11526 (_ BitVec 32))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12234))) (let ((.cse8 (select (select .cse15 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse14 (store .cse15 .cse8 v_ArrVal_12136))) (let ((.cse9 (select (select .cse14 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse13 (store .cse14 .cse9 v_ArrVal_12138))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse12 (store .cse13 .cse10 v_ArrVal_12139))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_12235) .cse8 v_ArrVal_12135) .cse9 v_ArrVal_12137) .cse10 v_ArrVal_12140) .cse11 v_ArrVal_11524) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc45#1.base_18| v_ArrVal_11526) (select (select (store .cse12 .cse11 v_ArrVal_11525) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5)))))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc45#1.base_18|))))))) is different from false [2023-11-29 07:10:12,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [766104626] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 07:10:12,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 07:10:12,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-11-29 07:10:12,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962335838] [2023-11-29 07:10:12,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 07:10:12,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 07:10:12,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 07:10:12,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 07:10:12,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=595, Unknown=51, NotChecked=682, Total=1482 [2023-11-29 07:10:12,274 INFO L87 Difference]: Start difference. First operand 933 states and 1058 transitions. Second operand has 21 states, 18 states have (on average 7.555555555555555) internal successors, (136), 21 states have internal predecessors, (136), 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)