./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:06:00,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:06:00,738 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:06:00,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:06:00,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:06:00,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:06:00,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:06:00,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:06:00,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:06:00,773 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:06:00,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:06:00,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:06:00,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:06:00,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:06:00,776 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:06:00,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:06:00,777 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:06:00,777 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:06:00,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:06:00,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:06:00,778 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:06:00,779 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:06:00,779 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:06:00,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:06:00,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:06:00,781 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:06:00,781 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:06:00,782 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:06:00,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:06:00,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:06:00,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:06:00,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:06:00,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:06:00,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:06:00,785 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:06:00,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:06:00,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:06:00,786 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:06:00,786 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:06:00,786 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:06:00,786 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:06:00,787 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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-11-29 01:06:01,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:06:01,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:06:01,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:06:01,029 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:06:01,030 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:06:01,031 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2023-11-29 01:06:03,851 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:06:04,106 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:06:04,106 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2023-11-29 01:06:04,124 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data/e4c03dd70/bfd5bb037e974aee989e5a119e90f46a/FLAGae87bb685 [2023-11-29 01:06:04,139 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data/e4c03dd70/bfd5bb037e974aee989e5a119e90f46a [2023-11-29 01:06:04,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:06:04,144 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:06:04,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:06:04,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:06:04,151 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:06:04,152 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:06:04" (1/1) ... [2023-11-29 01:06:04,153 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@597dbe7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:04, skipping insertion in model container [2023-11-29 01:06:04,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:06:04" (1/1) ... [2023-11-29 01:06:04,212 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:06:04,700 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:06:04,713 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 01:06:04,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b4bb3b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:04, skipping insertion in model container [2023-11-29 01:06:04,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:06:04,714 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 01:06:04,716 INFO L158 Benchmark]: Toolchain (without parser) took 571.51ms. Allocated memory is still 159.4MB. Free memory was 122.1MB in the beginning and 104.4MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:06:04,716 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 01:06:04,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 568.91ms. Allocated memory is still 159.4MB. Free memory was 121.6MB in the beginning and 104.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-29 01:06:04,718 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.20ms. Allocated memory is still 104.9MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 568.91ms. Allocated memory is still 159.4MB. Free memory was 121.6MB in the beginning and 104.4MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 738]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:06:06,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:06:06,964 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 01:06:06,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:06:06,978 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:06:07,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:06:07,012 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:06:07,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:06:07,014 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:06:07,015 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:06:07,015 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:06:07,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:06:07,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:06:07,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:06:07,018 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:06:07,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:06:07,021 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:06:07,021 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:06:07,022 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:06:07,023 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:06:07,023 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:06:07,024 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:06:07,025 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:06:07,025 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:06:07,026 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:06:07,027 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 01:06:07,027 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 01:06:07,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:06:07,028 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:06:07,028 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:06:07,029 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:06:07,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:06:07,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:06:07,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:06:07,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:06:07,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:06:07,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:06:07,031 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 01:06:07,032 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 01:06:07,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:06:07,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:06:07,033 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:06:07,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:06:07,033 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 01:06:07,033 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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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_148cbe85-9a42-40a3-b9a7-d77a24867ad4/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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2023-11-29 01:06:07,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:06:07,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:06:07,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:06:07,399 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:06:07,400 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:06:07,401 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2023-11-29 01:06:10,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:06:10,861 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:06:10,862 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2023-11-29 01:06:10,880 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data/442f3fe6d/bbb592b837654b65b100357aa6c429a5/FLAGdb5ca0737 [2023-11-29 01:06:10,895 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/data/442f3fe6d/bbb592b837654b65b100357aa6c429a5 [2023-11-29 01:06:10,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:06:10,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:06:10,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:06:10,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:06:10,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:06:10,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:06:10" (1/1) ... [2023-11-29 01:06:10,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bfc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:10, skipping insertion in model container [2023-11-29 01:06:10,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:06:10" (1/1) ... [2023-11-29 01:06:10,979 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:06:11,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:06:11,452 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 01:06:11,464 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:06:11,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:06:11,532 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:06:11,607 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:06:11,648 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:06:11,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11 WrapperNode [2023-11-29 01:06:11,649 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:06:11,650 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:06:11,650 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:06:11,650 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:06:11,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,686 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,728 INFO L138 Inliner]: procedures = 180, calls = 228, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 758 [2023-11-29 01:06:11,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:06:11,729 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:06:11,729 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:06:11,730 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:06:11,741 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,814 INFO L175 MemorySlicer]: Split 211 memory accesses to 3 slices as follows [204, 2, 5]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 51 writes are split as follows [50, 0, 1]. [2023-11-29 01:06:11,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,873 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,882 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:06:11,883 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:06:11,883 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:06:11,883 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:06:11,884 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (1/1) ... [2023-11-29 01:06:11,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:06:11,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:06:11,915 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:06:11,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:06:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 01:06:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 01:06:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 01:06:11,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 01:06:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 01:06:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 01:06:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 01:06:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 01:06:11,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 01:06:11,947 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 01:06:11,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 01:06:11,948 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 01:06:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 01:06:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:06:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:06:11,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 01:06:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 01:06:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 01:06:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 01:06:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 01:06:11,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 01:06:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:06:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 01:06:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 01:06:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 01:06:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 01:06:11,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 01:06:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 01:06:11,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:06:11,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:06:12,145 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:06:12,147 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:06:12,150 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:06:12,203 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:06:12,225 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 01:06:15,530 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:06:15,700 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:06:15,700 INFO L309 CfgBuilder]: Removed 40 assume(true) statements. [2023-11-29 01:06:15,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:06:15 BoogieIcfgContainer [2023-11-29 01:06:15,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:06:15,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:06:15,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:06:15,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:06:15,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:06:10" (1/3) ... [2023-11-29 01:06:15,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba70295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:06:15, skipping insertion in model container [2023-11-29 01:06:15,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:06:11" (2/3) ... [2023-11-29 01:06:15,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba70295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:06:15, skipping insertion in model container [2023-11-29 01:06:15,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:06:15" (3/3) ... [2023-11-29 01:06:15,710 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-2.i [2023-11-29 01:06:15,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:06:15,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2023-11-29 01:06:15,807 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:06:15,816 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;@5b2c61db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:06:15,817 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2023-11-29 01:06:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand has 767 states, 330 states have (on average 2.5606060606060606) internal successors, (845), 762 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 01:06:15,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:15,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 01:06:15,831 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:15,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash 39360962, now seen corresponding path program 1 times [2023-11-29 01:06:15,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:15,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766950090] [2023-11-29 01:06:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:15,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:15,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:15,859 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:15,886 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 01:06:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:16,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 01:06:16,050 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:16,064 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:16,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:16,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766950090] [2023-11-29 01:06:16,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1766950090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:16,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:16,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:16,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344966709] [2023-11-29 01:06:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:16,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:06:16,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:16,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:06:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:06:16,098 INFO L87 Difference]: Start difference. First operand has 767 states, 330 states have (on average 2.5606060606060606) internal successors, (845), 762 states have internal predecessors, (845), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:16,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:16,643 INFO L93 Difference]: Finished difference Result 757 states and 795 transitions. [2023-11-29 01:06:16,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:06:16,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 01:06:16,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:16,659 INFO L225 Difference]: With dead ends: 757 [2023-11-29 01:06:16,659 INFO L226 Difference]: Without dead ends: 756 [2023-11-29 01:06:16,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:06:16,663 INFO L413 NwaCegarLoop]: 709 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:16,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 709 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:06:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2023-11-29 01:06:16,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 756. [2023-11-29 01:06:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 325 states have (on average 2.4246153846153846) internal successors, (788), 751 states have internal predecessors, (788), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:16,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 794 transitions. [2023-11-29 01:06:16,746 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 794 transitions. Word has length 4 [2023-11-29 01:06:16,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:16,747 INFO L495 AbstractCegarLoop]: Abstraction has 756 states and 794 transitions. [2023-11-29 01:06:16,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:16,747 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 794 transitions. [2023-11-29 01:06:16,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 01:06:16,748 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:16,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 01:06:16,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:06:16,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:16,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:16,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 39361024, now seen corresponding path program 1 times [2023-11-29 01:06:16,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:16,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483427860] [2023-11-29 01:06:16,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:16,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:16,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:16,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:16,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 01:06:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:17,036 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:17,038 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:17,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:17,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:17,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483427860] [2023-11-29 01:06:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483427860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:17,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:17,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056739281] [2023-11-29 01:06:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:17,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:17,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:17,102 INFO L87 Difference]: Start difference. First operand 756 states and 794 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:18,611 INFO L93 Difference]: Finished difference Result 717 states and 756 transitions. [2023-11-29 01:06:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 01:06:18,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:18,616 INFO L225 Difference]: With dead ends: 717 [2023-11-29 01:06:18,617 INFO L226 Difference]: Without dead ends: 717 [2023-11-29 01:06:18,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:18,618 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 515 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:18,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 507 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 01:06:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2023-11-29 01:06:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2023-11-29 01:06:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 325 states have (on average 2.273846153846154) internal successors, (739), 702 states have internal predecessors, (739), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 745 transitions. [2023-11-29 01:06:18,634 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 745 transitions. Word has length 4 [2023-11-29 01:06:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:18,634 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 745 transitions. [2023-11-29 01:06:18,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 745 transitions. [2023-11-29 01:06:18,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 01:06:18,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:18,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 01:06:18,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-29 01:06:18,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:18,835 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:18,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 39361025, now seen corresponding path program 1 times [2023-11-29 01:06:18,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:18,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [787407542] [2023-11-29 01:06:18,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:18,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:18,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:18,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:18,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 01:06:18,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:18,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:06:18,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:18,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:18,942 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:18,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [787407542] [2023-11-29 01:06:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [787407542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:18,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:18,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107655382] [2023-11-29 01:06:18,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:18,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:18,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:18,956 INFO L87 Difference]: Start difference. First operand 707 states and 745 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:21,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:21,055 INFO L93 Difference]: Finished difference Result 766 states and 808 transitions. [2023-11-29 01:06:21,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:21,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-11-29 01:06:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:21,060 INFO L225 Difference]: With dead ends: 766 [2023-11-29 01:06:21,060 INFO L226 Difference]: Without dead ends: 766 [2023-11-29 01:06:21,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:21,062 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 231 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:21,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 790 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:06:21,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-11-29 01:06:21,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 719. [2023-11-29 01:06:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 719 states, 348 states have (on average 2.2557471264367814) internal successors, (785), 714 states have internal predecessors, (785), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 791 transitions. [2023-11-29 01:06:21,081 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 791 transitions. Word has length 4 [2023-11-29 01:06:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:21,081 INFO L495 AbstractCegarLoop]: Abstraction has 719 states and 791 transitions. [2023-11-29 01:06:21,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 791 transitions. [2023-11-29 01:06:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 01:06:21,082 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:21,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:06:21,084 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 01:06:21,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:21,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr324REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:21,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1221020111, now seen corresponding path program 1 times [2023-11-29 01:06:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:21,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551969982] [2023-11-29 01:06:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:21,285 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:21,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 01:06:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:21,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:06:21,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:21,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:21,356 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:21,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:21,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551969982] [2023-11-29 01:06:21,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551969982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:21,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:21,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:21,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974580886] [2023-11-29 01:06:21,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:21,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:21,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:21,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:21,358 INFO L87 Difference]: Start difference. First operand 719 states and 791 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:22,534 INFO L93 Difference]: Finished difference Result 1236 states and 1368 transitions. [2023-11-29 01:06:22,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:22,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2023-11-29 01:06:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:22,543 INFO L225 Difference]: With dead ends: 1236 [2023-11-29 01:06:22,543 INFO L226 Difference]: Without dead ends: 1236 [2023-11-29 01:06:22,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:22,544 INFO L413 NwaCegarLoop]: 826 mSDtfsCounter, 513 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:22,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 1472 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:06:22,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2023-11-29 01:06:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 720. [2023-11-29 01:06:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 349 states have (on average 2.2521489971346704) internal successors, (786), 715 states have internal predecessors, (786), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:22,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 792 transitions. [2023-11-29 01:06:22,566 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 792 transitions. Word has length 5 [2023-11-29 01:06:22,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:22,566 INFO L495 AbstractCegarLoop]: Abstraction has 720 states and 792 transitions. [2023-11-29 01:06:22,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 792 transitions. [2023-11-29 01:06:22,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 01:06:22,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:22,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:22,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 01:06:22,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:22,768 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:22,769 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:22,769 INFO L85 PathProgramCache]: Analyzing trace with hash 920420610, now seen corresponding path program 1 times [2023-11-29 01:06:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:22,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1227865723] [2023-11-29 01:06:22,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:22,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:22,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:22,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 01:06:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:22,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 01:06:22,916 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:22,925 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:22,925 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1227865723] [2023-11-29 01:06:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1227865723] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448303761] [2023-11-29 01:06:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:22,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:22,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:22,928 INFO L87 Difference]: Start difference. First operand 720 states and 792 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:23,767 INFO L93 Difference]: Finished difference Result 681 states and 752 transitions. [2023-11-29 01:06:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:23,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 01:06:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:23,774 INFO L225 Difference]: With dead ends: 681 [2023-11-29 01:06:23,774 INFO L226 Difference]: Without dead ends: 681 [2023-11-29 01:06:23,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:23,775 INFO L413 NwaCegarLoop]: 600 mSDtfsCounter, 70 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:23,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1151 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:06:23,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2023-11-29 01:06:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2023-11-29 01:06:23,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 334 states have (on average 2.2335329341317367) internal successors, (746), 676 states have internal predecessors, (746), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:23,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 752 transitions. [2023-11-29 01:06:23,798 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 752 transitions. Word has length 11 [2023-11-29 01:06:23,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:23,799 INFO L495 AbstractCegarLoop]: Abstraction has 681 states and 752 transitions. [2023-11-29 01:06:23,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 752 transitions. [2023-11-29 01:06:23,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-29 01:06:23,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:23,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:23,802 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:24,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:24,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:24,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash -239060164, now seen corresponding path program 1 times [2023-11-29 01:06:24,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:24,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52560141] [2023-11-29 01:06:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:24,003 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:24,004 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:24,005 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 01:06:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:24,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:24,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:24,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:24,172 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:24,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:24,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52560141] [2023-11-29 01:06:24,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52560141] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:24,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:24,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:24,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309480785] [2023-11-29 01:06:24,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:24,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:24,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:24,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:24,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:24,175 INFO L87 Difference]: Start difference. First operand 681 states and 752 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 01:06:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:25,265 INFO L93 Difference]: Finished difference Result 667 states and 731 transitions. [2023-11-29 01:06:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:25,267 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 01:06:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:25,272 INFO L225 Difference]: With dead ends: 667 [2023-11-29 01:06:25,272 INFO L226 Difference]: Without dead ends: 667 [2023-11-29 01:06:25,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:25,273 INFO L413 NwaCegarLoop]: 569 mSDtfsCounter, 58 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:25,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1683 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 01:06:25,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2023-11-29 01:06:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 666. [2023-11-29 01:06:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 333 states have (on average 2.174174174174174) internal successors, (724), 661 states have internal predecessors, (724), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:25,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 730 transitions. [2023-11-29 01:06:25,296 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 730 transitions. Word has length 13 [2023-11-29 01:06:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:25,296 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 730 transitions. [2023-11-29 01:06:25,296 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 01:06:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 730 transitions. [2023-11-29 01:06:25,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:06:25,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:25,298 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] [2023-11-29 01:06:25,302 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:25,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:25,499 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:25,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -808841014, now seen corresponding path program 1 times [2023-11-29 01:06:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092135020] [2023-11-29 01:06:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:25,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:25,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:25,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 01:06:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:25,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:06:25,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:25,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:25,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:25,772 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:25,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:25,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092135020] [2023-11-29 01:06:25,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092135020] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:25,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:25,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:25,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876101527] [2023-11-29 01:06:25,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:25,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:25,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:25,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:25,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:25,774 INFO L87 Difference]: Start difference. First operand 666 states and 730 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:27,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:27,863 INFO L93 Difference]: Finished difference Result 672 states and 737 transitions. [2023-11-29 01:06:27,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:27,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2023-11-29 01:06:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:27,869 INFO L225 Difference]: With dead ends: 672 [2023-11-29 01:06:27,869 INFO L226 Difference]: Without dead ends: 672 [2023-11-29 01:06:27,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:27,870 INFO L413 NwaCegarLoop]: 368 mSDtfsCounter, 448 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:27,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 713 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 01:06:27,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2023-11-29 01:06:27,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 662. [2023-11-29 01:06:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 333 states have (on average 2.1621621621621623) internal successors, (720), 657 states have internal predecessors, (720), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 726 transitions. [2023-11-29 01:06:27,899 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 726 transitions. Word has length 27 [2023-11-29 01:06:27,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:27,900 INFO L495 AbstractCegarLoop]: Abstraction has 662 states and 726 transitions. [2023-11-29 01:06:27,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 726 transitions. [2023-11-29 01:06:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 01:06:27,901 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:27,901 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] [2023-11-29 01:06:27,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 01:06:28,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:28,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:28,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:28,104 INFO L85 PathProgramCache]: Analyzing trace with hash -808841013, now seen corresponding path program 1 times [2023-11-29 01:06:28,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:28,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461794052] [2023-11-29 01:06:28,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:28,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:28,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:28,107 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:28,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 01:06:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:28,248 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 01:06:28,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:28,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:28,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:28,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:28,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:28,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461794052] [2023-11-29 01:06:28,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461794052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:28,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:28,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:28,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680063343] [2023-11-29 01:06:28,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:28,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:28,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:28,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:28,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:28,453 INFO L87 Difference]: Start difference. First operand 662 states and 726 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:30,819 INFO L93 Difference]: Finished difference Result 705 states and 739 transitions. [2023-11-29 01:06:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:30,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2023-11-29 01:06:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:30,823 INFO L225 Difference]: With dead ends: 705 [2023-11-29 01:06:30,823 INFO L226 Difference]: Without dead ends: 705 [2023-11-29 01:06:30,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:30,824 INFO L413 NwaCegarLoop]: 528 mSDtfsCounter, 167 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:30,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1012 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 01:06:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2023-11-29 01:06:30,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2023-11-29 01:06:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 333 states have (on average 2.15015015015015) internal successors, (716), 653 states have internal predecessors, (716), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 722 transitions. [2023-11-29 01:06:30,840 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 722 transitions. Word has length 27 [2023-11-29 01:06:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:30,840 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 722 transitions. [2023-11-29 01:06:30,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 722 transitions. [2023-11-29 01:06:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-11-29 01:06:30,842 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:30,842 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] [2023-11-29 01:06:30,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 01:06:31,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:31,043 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:31,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:31,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1070454460, now seen corresponding path program 1 times [2023-11-29 01:06:31,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:31,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [632727144] [2023-11-29 01:06:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:31,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:31,044 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:31,045 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:31,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 01:06:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:31,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:31,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:31,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:31,235 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:31,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:31,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [632727144] [2023-11-29 01:06:31,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [632727144] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:31,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298363192] [2023-11-29 01:06:31,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:31,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:31,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:31,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:31,237 INFO L87 Difference]: Start difference. First operand 658 states and 722 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:32,078 INFO L93 Difference]: Finished difference Result 652 states and 712 transitions. [2023-11-29 01:06:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:32,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 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 43 [2023-11-29 01:06:32,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:32,083 INFO L225 Difference]: With dead ends: 652 [2023-11-29 01:06:32,084 INFO L226 Difference]: Without dead ends: 652 [2023-11-29 01:06:32,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:32,084 INFO L413 NwaCegarLoop]: 563 mSDtfsCounter, 23 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:32,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1669 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:06:32,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2023-11-29 01:06:32,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 652. [2023-11-29 01:06:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 327 states have (on average 2.159021406727829) internal successors, (706), 647 states have internal predecessors, (706), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 712 transitions. [2023-11-29 01:06:32,094 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 712 transitions. Word has length 43 [2023-11-29 01:06:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:32,094 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 712 transitions. [2023-11-29 01:06:32,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 712 transitions. [2023-11-29 01:06:32,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-29 01:06:32,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:32,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:32,099 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 01:06:32,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:32,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr109REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:32,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:32,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1702874395, now seen corresponding path program 1 times [2023-11-29 01:06:32,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:32,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [706328897] [2023-11-29 01:06:32,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:32,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:32,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:32,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:32,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 01:06:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:32,459 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:32,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:32,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:32,749 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:32,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [706328897] [2023-11-29 01:06:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [706328897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:32,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:32,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:06:32,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883263246] [2023-11-29 01:06:32,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:32,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:06:32,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:06:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:32,751 INFO L87 Difference]: Start difference. First operand 652 states and 712 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:33,608 INFO L93 Difference]: Finished difference Result 876 states and 945 transitions. [2023-11-29 01:06:33,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:06:33,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-11-29 01:06:33,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:33,615 INFO L225 Difference]: With dead ends: 876 [2023-11-29 01:06:33,615 INFO L226 Difference]: Without dead ends: 876 [2023-11-29 01:06:33,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:06:33,616 INFO L413 NwaCegarLoop]: 630 mSDtfsCounter, 246 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:33,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1093 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:06:33,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2023-11-29 01:06:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 696. [2023-11-29 01:06:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 371 states have (on average 2.0215633423180592) internal successors, (750), 691 states have internal predecessors, (750), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 756 transitions. [2023-11-29 01:06:33,628 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 756 transitions. Word has length 47 [2023-11-29 01:06:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:33,628 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 756 transitions. [2023-11-29 01:06:33,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:33,629 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 756 transitions. [2023-11-29 01:06:33,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 01:06:33,630 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:33,630 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 01:06:33,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 01:06:33,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:33,835 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:33,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:33,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1715140969, now seen corresponding path program 1 times [2023-11-29 01:06:33,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:33,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578223958] [2023-11-29 01:06:33,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:33,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 01:06:33,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:33,837 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:33,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 01:06:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:34,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 01:06:34,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:34,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:34,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:34,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:06:34,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 01:06:34,623 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:06:34,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:06:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:34,646 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:34,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:34,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578223958] [2023-11-29 01:06:34,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578223958] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:34,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:34,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:06:34,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574836080] [2023-11-29 01:06:34,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:34,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:34,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:34,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:34,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:34,648 INFO L87 Difference]: Start difference. First operand 696 states and 756 transitions. Second operand has 4 states, 3 states have (on average 16.666666666666668) 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 01:06:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:36,466 INFO L93 Difference]: Finished difference Result 668 states and 729 transitions. [2023-11-29 01:06:36,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:36,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.666666666666668) 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 01:06:36,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:36,470 INFO L225 Difference]: With dead ends: 668 [2023-11-29 01:06:36,470 INFO L226 Difference]: Without dead ends: 668 [2023-11-29 01:06:36,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:36,471 INFO L413 NwaCegarLoop]: 276 mSDtfsCounter, 354 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:36,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 425 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 01:06:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2023-11-29 01:06:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 635. [2023-11-29 01:06:36,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 348 states have (on average 1.882183908045977) internal successors, (655), 630 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 661 transitions. [2023-11-29 01:06:36,485 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 661 transitions. Word has length 50 [2023-11-29 01:06:36,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:36,485 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 661 transitions. [2023-11-29 01:06:36,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.666666666666668) 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 01:06:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 661 transitions. [2023-11-29 01:06:36,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 01:06:36,487 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:36,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:36,494 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:06:36,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:36,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:36,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1416143778, now seen corresponding path program 1 times [2023-11-29 01:06:36,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:36,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1357092163] [2023-11-29 01:06:36,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:36,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:36,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:36,694 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:36,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 01:06:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:36,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:06:36,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:36,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:06:36,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:06:36,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 01:06:36,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:36,945 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:36,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:36,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1357092163] [2023-11-29 01:06:36,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1357092163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:36,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:36,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619195448] [2023-11-29 01:06:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:36,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:06:36,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:36,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:06:36,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:36,947 INFO L87 Difference]: Start difference. First operand 635 states and 661 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:39,132 INFO L93 Difference]: Finished difference Result 634 states and 660 transitions. [2023-11-29 01:06:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:06:39,134 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 01:06:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:39,137 INFO L225 Difference]: With dead ends: 634 [2023-11-29 01:06:39,137 INFO L226 Difference]: Without dead ends: 634 [2023-11-29 01:06:39,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:06:39,138 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 3 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:39,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1343 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-11-29 01:06:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2023-11-29 01:06:39,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2023-11-29 01:06:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 348 states have (on average 1.8793103448275863) internal successors, (654), 629 states have internal predecessors, (654), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 660 transitions. [2023-11-29 01:06:39,147 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 660 transitions. Word has length 54 [2023-11-29 01:06:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:39,148 INFO L495 AbstractCegarLoop]: Abstraction has 634 states and 660 transitions. [2023-11-29 01:06:39,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:39,148 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 660 transitions. [2023-11-29 01:06:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-11-29 01:06:39,149 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:39,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:06:39,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 01:06:39,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:39,356 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:39,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:39,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1416143777, now seen corresponding path program 1 times [2023-11-29 01:06:39,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:39,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331116093] [2023-11-29 01:06:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:39,357 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:39,358 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:39,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 01:06:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:39,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 01:06:39,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:39,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:06:39,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:06:39,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:06:39,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 01:06:39,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:39,707 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:39,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:39,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331116093] [2023-11-29 01:06:39,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331116093] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:39,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:39,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:39,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779002647] [2023-11-29 01:06:39,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:39,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:06:39,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:39,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:06:39,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:39,710 INFO L87 Difference]: Start difference. First operand 634 states and 660 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:42,433 INFO L93 Difference]: Finished difference Result 633 states and 659 transitions. [2023-11-29 01:06:42,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:06:42,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2023-11-29 01:06:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:42,438 INFO L225 Difference]: With dead ends: 633 [2023-11-29 01:06:42,438 INFO L226 Difference]: Without dead ends: 633 [2023-11-29 01:06:42,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:06:42,439 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 1 mSDsluCounter, 832 mSDsCounter, 0 mSdLazyCounter, 1080 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:42,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1369 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1080 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 01:06:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2023-11-29 01:06:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2023-11-29 01:06:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 347 states have (on average 1.8818443804034581) internal successors, (653), 628 states have internal predecessors, (653), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 01:06:42,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 659 transitions. [2023-11-29 01:06:42,456 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 659 transitions. Word has length 54 [2023-11-29 01:06:42,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:42,456 INFO L495 AbstractCegarLoop]: Abstraction has 633 states and 659 transitions. [2023-11-29 01:06:42,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:06:42,456 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 659 transitions. [2023-11-29 01:06:42,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 01:06:42,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:42,457 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] [2023-11-29 01:06:42,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 01:06:42,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:42,658 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:42,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash -277912286, now seen corresponding path program 1 times [2023-11-29 01:06:42,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:42,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252311295] [2023-11-29 01:06:42,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:42,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:42,660 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:42,661 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 01:06:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:42,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:06:42,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:42,889 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:06:42,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:42,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252311295] [2023-11-29 01:06:42,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252311295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:06:42,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:06:42,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:06:42,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328364802] [2023-11-29 01:06:42,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:06:42,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:06:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:42,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:06:42,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:06:42,891 INFO L87 Difference]: Start difference. First operand 633 states and 659 transitions. Second operand has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:06:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:43,672 INFO L93 Difference]: Finished difference Result 635 states and 662 transitions. [2023-11-29 01:06:43,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:06:43,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 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 60 [2023-11-29 01:06:43,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:43,678 INFO L225 Difference]: With dead ends: 635 [2023-11-29 01:06:43,678 INFO L226 Difference]: Without dead ends: 635 [2023-11-29 01:06:43,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:06:43,678 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 1 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1608 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:43,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1608 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:06:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2023-11-29 01:06:43,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2023-11-29 01:06:43,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 348 states have (on average 1.882183908045977) internal successors, (655), 630 states have internal predecessors, (655), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:06:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 662 transitions. [2023-11-29 01:06:43,692 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 662 transitions. Word has length 60 [2023-11-29 01:06:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:43,693 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 662 transitions. [2023-11-29 01:06:43,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.333333333333332) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:06:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 662 transitions. [2023-11-29 01:06:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-29 01:06:43,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:43,694 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] [2023-11-29 01:06:43,699 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 01:06:43,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:43,894 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:43,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2018344532, now seen corresponding path program 1 times [2023-11-29 01:06:43,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:43,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030622735] [2023-11-29 01:06:43,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:06:43,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:43,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:43,896 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:43,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 01:06:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:06:44,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 01:06:44,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:44,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:44,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030622735] [2023-11-29 01:06:44,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030622735] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:44,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:44,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 01:06:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111822086] [2023-11-29 01:06:44,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:44,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:06:44,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:44,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:06:44,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:06:44,238 INFO L87 Difference]: Start difference. First operand 635 states and 662 transitions. Second operand has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:06:45,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:45,718 INFO L93 Difference]: Finished difference Result 644 states and 676 transitions. [2023-11-29 01:06:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:06:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 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 61 [2023-11-29 01:06:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:45,722 INFO L225 Difference]: With dead ends: 644 [2023-11-29 01:06:45,722 INFO L226 Difference]: Without dead ends: 644 [2023-11-29 01:06:45,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 114 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 01:06:45,722 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 6 mSDsluCounter, 2670 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3206 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:45,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3206 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 01:06:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2023-11-29 01:06:45,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 643. [2023-11-29 01:06:45,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 355 states have (on average 1.8816901408450704) internal successors, (668), 637 states have internal predecessors, (668), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:06:45,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 675 transitions. [2023-11-29 01:06:45,735 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 675 transitions. Word has length 61 [2023-11-29 01:06:45,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:45,736 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 675 transitions. [2023-11-29 01:06:45,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.333333333333334) internal successors, (62), 8 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:06:45,736 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 675 transitions. [2023-11-29 01:06:45,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 01:06:45,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:45,737 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] [2023-11-29 01:06:45,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 01:06:45,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:45,937 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:45,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:45,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1972844450, now seen corresponding path program 2 times [2023-11-29 01:06:45,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:45,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23435276] [2023-11-29 01:06:45,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:06:45,938 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:45,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:45,939 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:45,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 01:06:46,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:06:46,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:06:46,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 01:06:46,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:46,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:46,543 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:46,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23435276] [2023-11-29 01:06:46,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23435276] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:46,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:46,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 01:06:46,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875989362] [2023-11-29 01:06:46,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:46,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 01:06:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:46,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 01:06:46,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 01:06:46,546 INFO L87 Difference]: Start difference. First operand 643 states and 675 transitions. Second operand has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:06:48,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:48,604 INFO L93 Difference]: Finished difference Result 658 states and 697 transitions. [2023-11-29 01:06:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:06:48,605 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 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 64 [2023-11-29 01:06:48,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:48,608 INFO L225 Difference]: With dead ends: 658 [2023-11-29 01:06:48,608 INFO L226 Difference]: Without dead ends: 656 [2023-11-29 01:06:48,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 01:06:48,609 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 12 mSDsluCounter, 3208 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3744 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:48,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3744 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-29 01:06:48,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2023-11-29 01:06:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 652. [2023-11-29 01:06:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 364 states have (on average 1.8681318681318682) internal successors, (680), 646 states have internal predecessors, (680), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:06:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 687 transitions. [2023-11-29 01:06:48,620 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 687 transitions. Word has length 64 [2023-11-29 01:06:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:48,620 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 687 transitions. [2023-11-29 01:06:48,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.666666666666667) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:06:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 687 transitions. [2023-11-29 01:06:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 01:06:48,621 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:48,621 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] [2023-11-29 01:06:48,627 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 01:06:48,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:48,822 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:48,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash -269477022, now seen corresponding path program 3 times [2023-11-29 01:06:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:48,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617039095] [2023-11-29 01:06:48,823 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 01:06:48,823 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:48,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:48,824 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:48,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 01:06:49,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 01:06:49,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:06:49,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 01:06:49,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:49,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:50,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:50,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617039095] [2023-11-29 01:06:50,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617039095] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:50,159 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 01:06:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587876245] [2023-11-29 01:06:50,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 01:06:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 01:06:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 01:06:50,161 INFO L87 Difference]: Start difference. First operand 652 states and 687 transitions. Second operand has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:06:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:06:56,256 INFO L93 Difference]: Finished difference Result 682 states and 737 transitions. [2023-11-29 01:06:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 01:06:56,257 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 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 70 [2023-11-29 01:06:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:06:56,260 INFO L225 Difference]: With dead ends: 682 [2023-11-29 01:06:56,260 INFO L226 Difference]: Without dead ends: 679 [2023-11-29 01:06:56,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 114 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 01:06:56,261 INFO L413 NwaCegarLoop]: 535 mSDtfsCounter, 24 mSDsluCounter, 8535 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9070 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:06:56,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9070 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-29 01:06:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2023-11-29 01:06:56,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 670. [2023-11-29 01:06:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 382 states have (on average 1.8403141361256545) internal successors, (703), 664 states have internal predecessors, (703), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:06:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 710 transitions. [2023-11-29 01:06:56,275 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 710 transitions. Word has length 70 [2023-11-29 01:06:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:06:56,275 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 710 transitions. [2023-11-29 01:06:56,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.3333333333333335) internal successors, (80), 26 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:06:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 710 transitions. [2023-11-29 01:06:56,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-29 01:06:56,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:06:56,276 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] [2023-11-29 01:06:56,283 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 01:06:56,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:56,477 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:06:56,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:06:56,477 INFO L85 PathProgramCache]: Analyzing trace with hash -488607006, now seen corresponding path program 4 times [2023-11-29 01:06:56,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:06:56,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1805018081] [2023-11-29 01:06:56,478 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 01:06:56,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:06:56,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:06:56,479 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:06:56,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 01:06:56,805 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 01:06:56,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:06:56,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 01:06:56,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:06:57,155 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:57,155 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:06:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:06:58,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:06:58,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1805018081] [2023-11-29 01:06:58,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1805018081] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:06:58,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:06:58,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 01:06:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728167278] [2023-11-29 01:06:58,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:06:58,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 01:06:58,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:06:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 01:06:58,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 01:06:58,656 INFO L87 Difference]: Start difference. First operand 670 states and 710 transitions. Second operand has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:07:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:07:14,238 INFO L93 Difference]: Finished difference Result 727 states and 799 transitions. [2023-11-29 01:07:14,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 01:07:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 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 82 [2023-11-29 01:07:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:07:14,244 INFO L225 Difference]: With dead ends: 727 [2023-11-29 01:07:14,244 INFO L226 Difference]: Without dead ends: 725 [2023-11-29 01:07:14,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 01:07:14,249 INFO L413 NwaCegarLoop]: 536 mSDtfsCounter, 47 mSDsluCounter, 14440 mSDsCounter, 0 mSdLazyCounter, 4505 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 14976 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 4505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:07:14,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 14976 Invalid, 4545 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 4505 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2023-11-29 01:07:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2023-11-29 01:07:14,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 704. [2023-11-29 01:07:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 416 states have (on average 1.8004807692307692) internal successors, (749), 698 states have internal predecessors, (749), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:07:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 756 transitions. [2023-11-29 01:07:14,276 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 756 transitions. Word has length 82 [2023-11-29 01:07:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:07:14,276 INFO L495 AbstractCegarLoop]: Abstraction has 704 states and 756 transitions. [2023-11-29 01:07:14,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 50 states have internal predecessors, (104), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 01:07:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 756 transitions. [2023-11-29 01:07:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 01:07:14,277 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:07:14,278 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] [2023-11-29 01:07:14,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:07:14,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:07:14,478 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:07:14,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:07:14,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1703719074, now seen corresponding path program 5 times [2023-11-29 01:07:14,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:07:14,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60583838] [2023-11-29 01:07:14,481 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:07:14,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:07:14,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:07:14,482 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:07:14,483 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 01:07:16,074 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:07:16,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:07:16,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 01:07:16,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:07:16,135 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 01:07:16,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 01:07:16,627 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 01:07:16,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 01:07:16,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:07:16,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 24 [2023-11-29 01:07:19,913 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:07:19,914 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 59 [2023-11-29 01:07:20,060 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 51 treesize of output 27 [2023-11-29 01:07:20,140 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:07:20,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:07:24,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:07:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60583838] [2023-11-29 01:07:24,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60583838] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:07:24,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [166116015] [2023-11-29 01:07:24,653 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 01:07:24,653 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:07:24,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:07:24,654 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:07:24,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 01:08:39,625 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 01:08:39,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:08:39,894 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:08:39,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:08:39,971 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:08:39,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:08:40,602 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 01:08:40,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 01:08:40,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:08:40,982 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 28 treesize of output 16 [2023-11-29 01:08:42,867 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:08:42,868 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 41 [2023-11-29 01:08:42,997 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 19 [2023-11-29 01:08:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:08:43,097 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:08:47,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [166116015] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:08:47,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:08:47,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-11-29 01:08:47,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137333290] [2023-11-29 01:08:47,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:08:47,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 01:08:47,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:08:47,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 01:08:47,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=353, Unknown=2, NotChecked=0, Total=420 [2023-11-29 01:08:47,650 INFO L87 Difference]: Start difference. First operand 704 states and 756 transitions. Second operand has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 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 01:08:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:08:59,990 INFO L93 Difference]: Finished difference Result 1310 states and 1408 transitions. [2023-11-29 01:08:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:08:59,990 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 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 104 [2023-11-29 01:08:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:08:59,996 INFO L225 Difference]: With dead ends: 1310 [2023-11-29 01:08:59,996 INFO L226 Difference]: Without dead ends: 1306 [2023-11-29 01:08:59,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 192 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=217, Invalid=1113, Unknown=2, NotChecked=0, Total=1332 [2023-11-29 01:08:59,997 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 2536 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2536 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 3663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:08:59,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2536 Valid, 2687 Invalid, 3663 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2023-11-29 01:08:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2023-11-29 01:09:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 703. [2023-11-29 01:09:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 703 states, 416 states have (on average 1.7884615384615385) internal successors, (744), 697 states have internal predecessors, (744), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:09:00,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 751 transitions. [2023-11-29 01:09:00,010 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 751 transitions. Word has length 104 [2023-11-29 01:09:00,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:09:00,011 INFO L495 AbstractCegarLoop]: Abstraction has 703 states and 751 transitions. [2023-11-29 01:09:00,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 2 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 01:09:00,011 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 751 transitions. [2023-11-29 01:09:00,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 01:09:00,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:09:00,012 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] [2023-11-29 01:09:00,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 01:09:00,252 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 01:09:00,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:09:00,413 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:09:00,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:09:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1703719075, now seen corresponding path program 1 times [2023-11-29 01:09:00,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:09:00,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544190166] [2023-11-29 01:09:00,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:00,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:09:00,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:09:00,417 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:09:00,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 01:09:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:09:01,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 01:09:01,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:09:01,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:09:01,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:09:01,699 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:09:01,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:09:01,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:09:01,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:09:01,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:09:01,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:09:02,673 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:09:02,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:09:02,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:09:02,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:09:02,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:09:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:09:02,775 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:09:04,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 01:09:04,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:09:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544190166] [2023-11-29 01:09:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544190166] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:09:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1343605352] [2023-11-29 01:09:04,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:09:04,250 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:09:04,250 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:09:04,250 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:09:04,252 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 01:10:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:41,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 01:10:41,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:41,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:42,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:10:42,074 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:10:42,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:10:42,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:10:42,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:10:42,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:10:42,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:10:42,758 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:10:42,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:10:42,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:10:42,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:10:42,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:10:42,813 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:42,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:44,093 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3173 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 01:10:44,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1343605352] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:44,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:10:44,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 01:10:44,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875118255] [2023-11-29 01:10:44,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:10:44,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:10:44,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:10:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:10:44,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 01:10:44,100 INFO L87 Difference]: Start difference. First operand 703 states and 751 transitions. Second operand has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:10:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:10:51,033 INFO L93 Difference]: Finished difference Result 712 states and 761 transitions. [2023-11-29 01:10:51,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:10:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 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 104 [2023-11-29 01:10:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:10:51,039 INFO L225 Difference]: With dead ends: 712 [2023-11-29 01:10:51,039 INFO L226 Difference]: Without dead ends: 712 [2023-11-29 01:10:51,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 01:10:51,040 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 293 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 2876 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:10:51,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1676 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2876 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2023-11-29 01:10:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2023-11-29 01:10:51,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 702. [2023-11-29 01:10:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 416 states have (on average 1.7860576923076923) internal successors, (743), 696 states have internal predecessors, (743), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:10:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 750 transitions. [2023-11-29 01:10:51,050 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 750 transitions. Word has length 104 [2023-11-29 01:10:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:10:51,050 INFO L495 AbstractCegarLoop]: Abstraction has 702 states and 750 transitions. [2023-11-29 01:10:51,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.571428571428571) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 01:10:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 750 transitions. [2023-11-29 01:10:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 01:10:51,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:10:51,051 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] [2023-11-29 01:10:51,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 01:10:51,260 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 01:10:51,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:51,451 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:10:51,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:10:51,452 INFO L85 PathProgramCache]: Analyzing trace with hash 892444637, now seen corresponding path program 1 times [2023-11-29 01:10:51,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:10:51,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585663106] [2023-11-29 01:10:51,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:51,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:10:51,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:10:51,453 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:10:51,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 01:10:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:10:52,257 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 01:10:52,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:10:52,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:10:52,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 01:10:52,395 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:10:52,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:10:52,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:10:52,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:10:52,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:10:52,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:10:53,282 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:53,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:10:53,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:10:53,399 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:10:53,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:10:53,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:10:53,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:10:53,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:10:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:10:53,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:10:53,600 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv4 32)) (bvadd .cse1 (_ bv8 32))))))) is different from false [2023-11-29 01:10:53,639 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_3627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-11-29 01:10:54,908 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3719 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3718))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3719) .cse0 v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_3627) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3719 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3719) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_3718) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3626) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-11-29 01:10:54,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:10:54,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [585663106] [2023-11-29 01:10:54,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [585663106] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:10:54,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1998367640] [2023-11-29 01:10:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:10:54,917 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:10:54,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:10:54,918 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:10:54,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 01:12:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:31,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 01:12:31,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:31,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:12:32,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:12:32,089 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:12:32,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:12:32,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:12:32,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:12:32,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:12:32,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:12:32,944 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:32,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:32,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:33,109 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:33,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:12:33,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:12:33,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:12:33,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:12:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:12:33,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:33,193 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:12:33,227 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4173 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_4173) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:12:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1998367640] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:35,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:12:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 01:12:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483427584] [2023-11-29 01:12:35,055 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:35,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 01:12:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:12:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 01:12:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=250, Unknown=12, NotChecked=180, Total=506 [2023-11-29 01:12:35,056 INFO L87 Difference]: Start difference. First operand 702 states and 750 transitions. Second operand has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:12:42,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:12:42,808 INFO L93 Difference]: Finished difference Result 711 states and 760 transitions. [2023-11-29 01:12:42,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:12:42,809 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 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 106 [2023-11-29 01:12:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:12:42,812 INFO L225 Difference]: With dead ends: 711 [2023-11-29 01:12:42,812 INFO L226 Difference]: Without dead ends: 711 [2023-11-29 01:12:42,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=108, Invalid=406, Unknown=12, NotChecked=230, Total=756 [2023-11-29 01:12:42,813 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 348 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:12:42,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1836 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-29 01:12:42,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-29 01:12:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 701. [2023-11-29 01:12:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 416 states have (on average 1.7836538461538463) internal successors, (742), 695 states have internal predecessors, (742), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:12:42,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 749 transitions. [2023-11-29 01:12:42,823 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 749 transitions. Word has length 106 [2023-11-29 01:12:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:12:42,824 INFO L495 AbstractCegarLoop]: Abstraction has 701 states and 749 transitions. [2023-11-29 01:12:42,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.833333333333334) internal successors, (118), 15 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:12:42,824 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 749 transitions. [2023-11-29 01:12:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-11-29 01:12:42,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:12:42,825 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] [2023-11-29 01:12:42,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 01:12:43,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Ended with exit code 0 [2023-11-29 01:12:43,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:12:43,227 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:12:43,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:12:43,228 INFO L85 PathProgramCache]: Analyzing trace with hash 892444636, now seen corresponding path program 1 times [2023-11-29 01:12:43,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:12:43,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814790657] [2023-11-29 01:12:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:43,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:12:43,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:12:43,230 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:12:43,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 01:12:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:43,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 01:12:43,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:43,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:12:44,117 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:12:44,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:12:44,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:12:44,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:12:45,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:12:45,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:12:45,222 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:12:45,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:12:45,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:12:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:12:45,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:45,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_4672) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:12:45,333 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4672 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:12:45,708 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4718 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4672 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_4718))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4672)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:12:45,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:12:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814790657] [2023-11-29 01:12:45,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814790657] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:45,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [142988440] [2023-11-29 01:12:45,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:12:45,711 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:12:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:12:45,712 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:12:45,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 01:12:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:12:47,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:12:47,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:12:47,727 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:12:47,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:12:48,201 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 01:12:48,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 01:12:48,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:12:48,475 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 28 treesize of output 16 [2023-11-29 01:12:49,782 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:49,783 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 41 [2023-11-29 01:12:49,958 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:12:49,958 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 41 [2023-11-29 01:12:49,977 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 19 [2023-11-29 01:12:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:12:50,036 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:12:54,119 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5125 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:12:54,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5171 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5125 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5171))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5125)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:12:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [142988440] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:12:54,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:12:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2023-11-29 01:12:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086924196] [2023-11-29 01:12:54,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:12:54,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:12:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:12:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:12:54,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=377, Unknown=7, NotChecked=220, Total=702 [2023-11-29 01:12:54,526 INFO L87 Difference]: Start difference. First operand 701 states and 749 transitions. Second operand has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 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 01:13:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:03,490 INFO L93 Difference]: Finished difference Result 1300 states and 1394 transitions. [2023-11-29 01:13:03,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:13:03,491 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 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 106 [2023-11-29 01:13:03,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:03,496 INFO L225 Difference]: With dead ends: 1300 [2023-11-29 01:13:03,496 INFO L226 Difference]: Without dead ends: 1300 [2023-11-29 01:13:03,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=127, Invalid=486, Unknown=7, NotChecked=250, Total=870 [2023-11-29 01:13:03,497 INFO L413 NwaCegarLoop]: 281 mSDtfsCounter, 807 mSDsluCounter, 2490 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 2771 SdHoareTripleChecker+Invalid, 3685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:03,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 2771 Invalid, 3685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2023-11-29 01:13:03,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2023-11-29 01:13:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 700. [2023-11-29 01:13:03,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 416 states have (on average 1.78125) internal successors, (741), 694 states have internal predecessors, (741), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:13:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 748 transitions. [2023-11-29 01:13:03,515 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 748 transitions. Word has length 106 [2023-11-29 01:13:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:03,516 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 748 transitions. [2023-11-29 01:13:03,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.75) internal successors, (124), 19 states have internal predecessors, (124), 2 states have call successors, (2), 2 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 01:13:03,516 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 748 transitions. [2023-11-29 01:13:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 01:13:03,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:03,517 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:13:03,528 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Ended with exit code 0 [2023-11-29 01:13:03,726 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 01:13:03,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:13:03,918 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:13:03,918 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1353215248, now seen corresponding path program 1 times [2023-11-29 01:13:03,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:13:03,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065966037] [2023-11-29 01:13:03,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:03,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:13:03,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:13:03,920 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:13:03,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 01:13:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:04,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 01:13:04,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:04,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:13:04,953 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:13:04,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:13:04,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:13:05,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:13:05,976 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:05,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:13:06,087 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:06,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:13:06,170 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:06,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:13:06,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:13:06,222 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:13:06,222 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:10,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5594 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5594) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:13:10,355 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5594 (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$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:13:10,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5593 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5594 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5640 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_5640))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5593)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5594)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:13:10,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:13:10,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065966037] [2023-11-29 01:13:10,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065966037] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:10,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [325995916] [2023-11-29 01:13:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:10,846 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:13:10,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:13:10,847 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:13:10,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 01:13:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:38,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 01:13:38,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:38,240 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:13:38,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:13:38,767 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 01:13:38,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 01:13:38,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:13:39,182 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 28 treesize of output 16 [2023-11-29 01:13:40,861 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:13:40,861 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 41 [2023-11-29 01:13:41,137 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:13:41,138 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 41 [2023-11-29 01:13:41,314 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:13:41,314 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 41 [2023-11-29 01:13:41,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 01:13:41,453 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:13:41,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:41,474 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6063) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))))) is different from false [2023-11-29 01:13:41,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6063 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6063) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:13:41,505 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6063 (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$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:13:41,522 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6063 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6062))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:13:42,030 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6062 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6109 (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$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6109))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6062)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6063)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:13:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [325995916] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:42,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:13:42,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2023-11-29 01:13:42,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491390409] [2023-11-29 01:13:42,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:13:42,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 01:13:42,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:13:42,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 01:13:42,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=492, Unknown=12, NotChecked=424, Total=1056 [2023-11-29 01:13:42,037 INFO L87 Difference]: Start difference. First operand 700 states and 748 transitions. Second operand has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 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 01:13:53,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:13:53,190 INFO L93 Difference]: Finished difference Result 1298 states and 1392 transitions. [2023-11-29 01:13:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 01:13:53,191 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 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 108 [2023-11-29 01:13:53,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:13:53,196 INFO L225 Difference]: With dead ends: 1298 [2023-11-29 01:13:53,196 INFO L226 Difference]: Without dead ends: 1298 [2023-11-29 01:13:53,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=160, Invalid=616, Unknown=12, NotChecked=472, Total=1260 [2023-11-29 01:13:53,197 INFO L413 NwaCegarLoop]: 280 mSDtfsCounter, 1357 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 2505 SdHoareTripleChecker+Invalid, 3360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:13:53,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 2505 Invalid, 3360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 01:13:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2023-11-29 01:13:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 699. [2023-11-29 01:13:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 416 states have (on average 1.7788461538461537) internal successors, (740), 693 states have internal predecessors, (740), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:13:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 747 transitions. [2023-11-29 01:13:53,211 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 747 transitions. Word has length 108 [2023-11-29 01:13:53,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:13:53,211 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 747 transitions. [2023-11-29 01:13:53,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 7.111111111111111) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (2), 2 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 01:13:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 747 transitions. [2023-11-29 01:13:53,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-29 01:13:53,212 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:13:53,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] [2023-11-29 01:13:53,224 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 01:13:53,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 01:13:53,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:13:53,613 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:13:53,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:13:53,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1353215247, now seen corresponding path program 1 times [2023-11-29 01:13:53,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:13:53,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107470886] [2023-11-29 01:13:53,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:53,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 01:13:53,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:13:53,615 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:13:53,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 01:13:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:13:54,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 115 conjunts are in the unsatisfiable core [2023-11-29 01:13:54,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:13:54,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:13:54,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:13:54,901 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:13:54,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:13:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:13:54,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:13:55,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:13:55,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:13:55,931 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:55,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:13:55,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:13:56,082 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:56,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:13:56,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:13:56,219 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:13:56,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:13:56,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:13:56,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:13:56,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:13:56,303 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:13:56,304 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:13:56,508 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 01:13:56,551 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:13:56,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6577))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6578) .cse0 v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6578) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 01:13:56,818 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_6578) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_6577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_6577))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_6578) .cse3 v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:13:58,474 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6671))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6672) .cse1 v_ArrVal_6578) (select (select (store .cse2 .cse1 v_ArrVal_6577) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6580))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6577 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6578 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6579 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6671))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6577))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_6672) .cse4 v_ArrVal_6578) .cse5 v_ArrVal_6580) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6579) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:13:58,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:13:58,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107470886] [2023-11-29 01:13:58,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107470886] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:13:58,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [708058121] [2023-11-29 01:13:58,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:13:58,492 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:13:58,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:13:58,493 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:13:58,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 01:14:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:27,480 INFO L262 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:14:27,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:27,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:14:27,890 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:14:27,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:14:27,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:14:27,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:14:27,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:14:28,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:14:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:14:28,967 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:14:28,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:14:28,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:14:29,182 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:14:29,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:14:29,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:14:29,330 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:14:29,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:14:29,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:14:29,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:14:29,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:14:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:14:29,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:29,444 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 01:14:29,486 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_7142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 01:14:29,634 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7140))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7141) .cse0 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7141) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7140) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 01:14:29,766 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_7141) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_7140) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_7140))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_7141) .cse3 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:14:31,327 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7235))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7234) .cse1 v_ArrVal_7141) (select (select (store .cse2 .cse1 v_ArrVal_7140) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7143))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7140 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7141 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7142 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7143 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7234 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7235 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7235))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7140))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_7234) .cse4 v_ArrVal_7141) .cse5 v_ArrVal_7143) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7142) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:14:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [708058121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:31,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:14:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 01:14:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474556912] [2023-11-29 01:14:31,351 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:14:31,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 01:14:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:14:31,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 01:14:31,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 01:14:31,353 INFO L87 Difference]: Start difference. First operand 699 states and 747 transitions. Second operand has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:14:44,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:14:44,253 INFO L93 Difference]: Finished difference Result 708 states and 757 transitions. [2023-11-29 01:14:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:14:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 108 [2023-11-29 01:14:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:14:44,259 INFO L225 Difference]: With dead ends: 708 [2023-11-29 01:14:44,259 INFO L226 Difference]: Without dead ends: 708 [2023-11-29 01:14:44,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 200 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 01:14:44,260 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 335 mSDsluCounter, 1846 mSDsCounter, 0 mSdLazyCounter, 4381 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 4389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 4381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:14:44,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 2203 Invalid, 4389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 4381 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2023-11-29 01:14:44,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2023-11-29 01:14:44,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 698. [2023-11-29 01:14:44,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 416 states have (on average 1.7764423076923077) internal successors, (739), 692 states have internal predecessors, (739), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:14:44,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 746 transitions. [2023-11-29 01:14:44,270 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 746 transitions. Word has length 108 [2023-11-29 01:14:44,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:14:44,270 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 746 transitions. [2023-11-29 01:14:44,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.714285714285714) internal successors, (122), 17 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:14:44,270 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 746 transitions. [2023-11-29 01:14:44,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:14:44,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:14:44,271 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:14:44,282 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 01:14:44,497 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 01:14:44,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:14:44,672 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:14:44,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:14:44,672 INFO L85 PathProgramCache]: Analyzing trace with hash 936180574, now seen corresponding path program 1 times [2023-11-29 01:14:44,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:14:44,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793327244] [2023-11-29 01:14:44,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:44,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:14:44,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:14:44,674 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:14:44,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 01:14:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:14:45,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 01:14:45,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:14:45,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:14:46,070 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:14:46,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:14:46,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:14:46,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:14:47,347 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:47,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:14:47,509 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:47,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:14:47,626 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:47,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 44 treesize of output 43 [2023-11-29 01:14:47,748 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:14:47,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:14:47,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:14:47,820 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:14:47,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:14:47,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:47,925 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7674 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7674) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:47,943 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (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$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7673))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7674)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:14:47,960 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7673))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7674)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:14:47,980 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (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$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7672))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7673)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7674)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:14:48,003 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7674 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7673 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7672 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7672))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7673)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7674)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:14:48,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:14:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793327244] [2023-11-29 01:14:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793327244] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:14:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [676279367] [2023-11-29 01:14:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:14:48,620 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:14:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:14:48,621 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:14:48,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 01:15:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:23,975 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:15:23,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:24,041 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:15:24,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:15:24,525 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 01:15:24,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 01:15:24,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:15:24,859 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 28 treesize of output 16 [2023-11-29 01:15:26,215 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:26,215 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 41 [2023-11-29 01:15:26,442 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:26,442 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 41 [2023-11-29 01:15:26,574 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:26,575 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 41 [2023-11-29 01:15:26,716 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:15:26,716 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 41 [2023-11-29 01:15:26,734 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 19 [2023-11-29 01:15:26,813 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:15:26,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:30,936 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8159 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8159) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 01:15:30,949 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8158 (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$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8158))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8159)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:15:30,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8158 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8158))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8159)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:15:30,980 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8157 (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$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8157))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8158)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8159)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:15:30,999 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8157 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8157))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8158)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8159)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:15:31,478 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8205 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8157 (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 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8205))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8157)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8158)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8159)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:15:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [676279367] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:15:31,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:15:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-11-29 01:15:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761022485] [2023-11-29 01:15:31,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:15:31,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 01:15:31,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:15:31,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 01:15:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=590, Unknown=16, NotChecked=732, Total=1482 [2023-11-29 01:15:31,485 INFO L87 Difference]: Start difference. First operand 698 states and 746 transitions. Second operand has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 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 01:15:42,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:15:42,833 INFO L93 Difference]: Finished difference Result 1294 states and 1388 transitions. [2023-11-29 01:15:42,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 01:15:42,834 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 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 110 [2023-11-29 01:15:42,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:15:42,838 INFO L225 Difference]: With dead ends: 1294 [2023-11-29 01:15:42,838 INFO L226 Difference]: Without dead ends: 1294 [2023-11-29 01:15:42,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=175, Invalid=727, Unknown=16, NotChecked=804, Total=1722 [2023-11-29 01:15:42,839 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 1345 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 4481 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1349 SdHoareTripleChecker+Valid, 3328 SdHoareTripleChecker+Invalid, 4502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-29 01:15:42,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1349 Valid, 3328 Invalid, 4502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4481 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-11-29 01:15:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2023-11-29 01:15:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 697. [2023-11-29 01:15:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 416 states have (on average 1.7740384615384615) internal successors, (738), 691 states have internal predecessors, (738), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:15:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 745 transitions. [2023-11-29 01:15:42,849 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 745 transitions. Word has length 110 [2023-11-29 01:15:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:15:42,850 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 745 transitions. [2023-11-29 01:15:42,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.6) internal successors, (132), 23 states have internal predecessors, (132), 2 states have call successors, (2), 2 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 01:15:42,850 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 745 transitions. [2023-11-29 01:15:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 01:15:42,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:15:42,851 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:15:42,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Ended with exit code 0 [2023-11-29 01:15:43,071 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 01:15:43,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:15:43,251 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:15:43,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:15:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 936180575, now seen corresponding path program 1 times [2023-11-29 01:15:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:15:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838430876] [2023-11-29 01:15:43,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:15:43,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:15:43,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:15:43,253 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:15:43,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 01:15:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:15:44,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 01:15:44,386 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:15:44,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:15:44,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:15:44,534 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:15:44,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:15:44,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:15:44,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:15:44,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 01:15:44,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:15:45,366 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:45,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:15:45,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:15:45,487 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:45,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:15:45,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:15:45,585 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:45,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:15:45,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:15:45,694 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:15:45,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 01:15:45,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:15:45,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 01:15:45,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:15:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:15:45,757 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:15:45,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-11-29 01:15:45,948 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_8693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_8692) |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 01:15:47,777 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8690 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8690) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8690 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_8691))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv24 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_8690) .cse3 v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:15:48,083 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8688))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8691))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8689) .cse0 v_ArrVal_8690) .cse1 v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8688 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8688))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8689) .cse6 v_ArrVal_8690) (select (select (store .cse7 .cse6 v_ArrVal_8691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8692))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 01:16:02,496 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8785))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_8688))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8784) .cse1 v_ArrVal_8689) .cse2 v_ArrVal_8690) (select (select (store .cse3 .cse2 v_ArrVal_8691) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8692))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8693 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8692 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8691 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8690 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8689 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8785 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8785))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_8688))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_8691))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_8784) .cse6 v_ArrVal_8689) .cse7 v_ArrVal_8690) .cse8 v_ArrVal_8692) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_8693) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 01:16:02,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:16:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838430876] [2023-11-29 01:16:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838430876] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2103992603] [2023-11-29 01:16:02,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:16:02,538 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:16:02,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:16:02,539 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:16:02,539 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 01:16:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:16:34,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 121 conjunts are in the unsatisfiable core [2023-11-29 01:16:34,983 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:16:35,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:16:37,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:16:37,940 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 01:16:37,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 01:16:38,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:16:38,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:16:39,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 01:16:39,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:16:44,798 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:44,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 50 treesize of output 45 [2023-11-29 01:16:44,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:16:46,118 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:46,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:16:46,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:16:46,996 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:46,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:16:47,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:16:47,903 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:16:47,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 01:16:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 01:16:48,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 01:16:48,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 01:16:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:16:48,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:16:48,346 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:16:48,467 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 01:16:48,596 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9270) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9271))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9270) .cse2 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 01:16:48,773 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9270) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9270 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9271))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9270) .cse3 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 01:16:48,925 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (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)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9268))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9269) .cse1 v_ArrVal_9270) (select (select (store .cse2 .cse1 v_ArrVal_9271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9273))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd (_ bv24 32) .cse0)))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (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)))) (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9268))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9271))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv24 32) (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9269) .cse4 v_ArrVal_9270) .cse5 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 01:16:49,080 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (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)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9268))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9269) .cse2 v_ArrVal_9270) (select (select (store .cse3 .cse2 v_ArrVal_9271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_9273))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (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)))) (let ((.cse8 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_9268))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_9271))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_9269) .cse5 v_ArrVal_9270) .cse6 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 01:16:57,414 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (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)))) (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9365))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9268))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9271))) (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$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9364) .cse0 v_ArrVal_9269) .cse1 v_ArrVal_9270) .cse2 v_ArrVal_9273) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9272) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9271 (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)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9365))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9268))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9364) .cse8 v_ArrVal_9269) .cse9 v_ArrVal_9270) (select (select (store .cse10 .cse9 v_ArrVal_9271) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9273))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-11-29 01:16:57,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2103992603] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:16:57,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:16:57,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-11-29 01:16:57,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554446426] [2023-11-29 01:16:57,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:16:57,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 01:16:57,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:16:57,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 01:16:57,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=416, Unknown=28, NotChecked=636, Total=1190 [2023-11-29 01:16:57,460 INFO L87 Difference]: Start difference. First operand 697 states and 745 transitions. Second operand has 19 states, 16 states have (on average 7.875) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:17:51,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:51,679 INFO L93 Difference]: Finished difference Result 706 states and 755 transitions. [2023-11-29 01:17:51,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:17:51,681 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.875) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-11-29 01:17:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:51,685 INFO L225 Difference]: With dead ends: 706 [2023-11-29 01:17:51,686 INFO L226 Difference]: Without dead ends: 706 [2023-11-29 01:17:51,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=180, Invalid=710, Unknown=28, NotChecked=804, Total=1722 [2023-11-29 01:17:51,687 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 617 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 3005 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 619 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 3023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:51,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [619 Valid, 1569 Invalid, 3023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3005 Invalid, 0 Unknown, 0 Unchecked, 51.4s Time] [2023-11-29 01:17:51,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2023-11-29 01:17:51,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 696. [2023-11-29 01:17:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 696 states, 416 states have (on average 1.7716346153846154) internal successors, (737), 690 states have internal predecessors, (737), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:17:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 744 transitions. [2023-11-29 01:17:51,700 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 744 transitions. Word has length 110 [2023-11-29 01:17:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:51,701 INFO L495 AbstractCegarLoop]: Abstraction has 696 states and 744 transitions. [2023-11-29 01:17:51,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.875) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 01:17:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 744 transitions. [2023-11-29 01:17:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:17:51,702 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:51,702 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:51,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 01:17:51,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-11-29 01:17:52,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:17:52,103 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:17:52,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:52,103 INFO L85 PathProgramCache]: Analyzing trace with hash 2022334245, now seen corresponding path program 1 times [2023-11-29 01:17:52,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:17:52,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961588777] [2023-11-29 01:17:52,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:52,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:17:52,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:17:52,105 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:17:52,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 01:17:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:53,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 01:17:53,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:53,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:17:55,280 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:17:55,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:17:55,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:17:56,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 01:18:04,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:18:04,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:18:05,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:18:05,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:18:05,904 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:18:05,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:18:06,728 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:18:06,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:18:07,563 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:18:07,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 01:18:07,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 01:18:08,040 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 01:18:08,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2023-11-29 01:18:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:18:08,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:09,488 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9822) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:18:09,570 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9822) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:18:09,656 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9821))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 01:18:09,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9821))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:18:09,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9820 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9820))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9821)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:18:09,923 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9820 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9820))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9821)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 01:18:10,023 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9820 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9819))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9820)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9821)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:18:10,121 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9820 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9819))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9820)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9821)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 01:18:12,220 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9819 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9822 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9821 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9820 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_9869))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9819)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9820)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9821)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9822)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 01:18:12,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 01:18:12,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961588777] [2023-11-29 01:18:12,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961588777] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:12,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [366344923] [2023-11-29 01:18:12,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:12,243 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 01:18:12,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 01:18:12,244 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 01:18:12,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 01:18:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 01:18:17,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:17,804 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 01:18:17,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 01:18:23,296 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 01:18:23,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2023-11-29 01:18:24,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 01:18:26,186 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 28 treesize of output 16 [2023-11-29 01:18:39,816 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:18:39,816 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 41 [2023-11-29 01:18:41,668 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:18:41,669 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 41 [2023-11-29 01:18:43,083 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:18:43,084 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 41 [2023-11-29 01:18:44,448 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:18:44,448 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 41 [2023-11-29 01:18:45,805 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 01:18:45,805 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 41 [2023-11-29 01:18:45,949 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 19 [2023-11-29 01:18:46,863 INFO L349 Elim1Store]: treesize reduction 82, result has 29.3 percent of original size [2023-11-29 01:18:46,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 35 treesize of output 52 [2023-11-29 01:18:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:18:47,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:18:53,599 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10326) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1))))) is different from false [2023-11-29 01:18:53,720 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (v_ArrVal_10325 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10325))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))))) is different from false [2023-11-29 01:18:53,842 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (v_ArrVal_10325 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10325))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))))) is different from false [2023-11-29 01:18:53,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (v_ArrVal_10324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10325 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10324))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10325)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:18:54,094 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (v_ArrVal_10324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10325 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10324))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10325)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:18:54,225 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (v_ArrVal_10324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10325 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (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$#0.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10323))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10324)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10325)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))))) is different from false [2023-11-29 01:18:54,362 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10326 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10327 (_ BitVec 1)) (v_ArrVal_10324 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10325 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17|))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_17| v_ArrVal_10327) (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10323))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10324)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10325)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10326)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 01:18:57,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [366344923] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:57,284 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:18:57,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 25 [2023-11-29 01:18:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706714205] [2023-11-29 01:18:57,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 01:18:57,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 01:18:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 01:18:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 01:18:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=786, Unknown=21, NotChecked=1168, Total=2162 [2023-11-29 01:18:57,286 INFO L87 Difference]: Start difference. First operand 696 states and 744 transitions. Second operand has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 states have internal predecessors, (136), 2 states have call successors, (2), 2 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 01:20:18,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:20:18,277 INFO L93 Difference]: Finished difference Result 1290 states and 1384 transitions. [2023-11-29 01:20:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 01:20:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 states have internal predecessors, (136), 2 states have call successors, (2), 2 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 112 [2023-11-29 01:20:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:20:18,284 INFO L225 Difference]: With dead ends: 1290 [2023-11-29 01:20:18,284 INFO L226 Difference]: Without dead ends: 1290 [2023-11-29 01:20:18,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 199 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=221, Invalid=944, Unknown=21, NotChecked=1264, Total=2450 [2023-11-29 01:20:18,285 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 1059 mSDsluCounter, 3148 mSDsCounter, 0 mSdLazyCounter, 4660 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 4679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 79.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:20:18,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 3426 Invalid, 4679 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [19 Valid, 4660 Invalid, 0 Unknown, 0 Unchecked, 79.5s Time] [2023-11-29 01:20:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2023-11-29 01:20:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 695. [2023-11-29 01:20:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 695 states, 416 states have (on average 1.7692307692307692) internal successors, (736), 689 states have internal predecessors, (736), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-29 01:20:18,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 743 transitions. [2023-11-29 01:20:18,296 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 743 transitions. Word has length 112 [2023-11-29 01:20:18,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:20:18,297 INFO L495 AbstractCegarLoop]: Abstraction has 695 states and 743 transitions. [2023-11-29 01:20:18,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 5.913043478260869) internal successors, (136), 25 states have internal predecessors, (136), 2 states have call successors, (2), 2 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 01:20:18,297 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 743 transitions. [2023-11-29 01:20:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 01:20:18,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:20:18,298 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:20:18,310 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-11-29 01:20:18,514 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 01:20:18,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 01:20:18,698 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2023-11-29 01:20:18,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:20:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2022334246, now seen corresponding path program 1 times [2023-11-29 01:20:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 01:20:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304738841] [2023-11-29 01:20:18,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:20:18,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 01:20:18,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 01:20:18,700 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 01:20:18,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_148cbe85-9a42-40a3-b9a7-d77a24867ad4/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 01:20:20,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:20:20,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 01:20:20,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:20:20,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 01:20:22,048 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 01:20:22,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 01:20:22,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 01:20:22,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 01:20:22,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:20:23,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2023-11-29 01:20:23,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:20:35,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:20:35,561 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 01:20:35,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:20:36,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:20:36,777 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 01:20:36,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:20:37,756 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:20:37,757 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 01:20:37,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:20:38,821 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:20:38,821 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 01:20:38,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:20:39,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 01:20:39,889 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 01:20:39,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 01:20:40,130 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 01:20:40,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:20:40,181 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 01:20:40,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 01:20:40,514 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-29 01:20:40,514 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 01:20:40,829 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 01:20:40,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:20:42,624 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10882 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10882) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))))) is different from false [2023-11-29 01:20:42,858 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10882 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10882) (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_10880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse2 (bvadd .cse2 (_ bv4 32))))))))) is different from false [2023-11-29 01:20:43,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_10882 (_ BitVec 32))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10878))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10879) .cse0 v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10882) (select (select (store .cse2 .cse0 v_ArrVal_10880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|)))) (forall ((v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10879) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule .cse3 (bvadd (_ bv4 32) .cse3))))))) is different from false [2023-11-29 01:20:43,337 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (or (forall ((v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_10879) (select (select (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_10878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))) (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10882 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| .cse1 v_ArrVal_10878))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#0.offset| .cse1 v_ArrVal_10879) .cse3 v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10882) (select (select (store .cse4 .cse3 v_ArrVal_10880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))))) is different from false [2023-11-29 01:20:43,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10877 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32)) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))) (forall ((v_ArrVal_10882 (_ BitVec 32))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10876))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10878))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10877) .cse0 v_ArrVal_10879) .cse1 v_ArrVal_10881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc41#1.base_18| v_ArrVal_10882) (select (select (store .cse3 .cse1 v_ArrVal_10880) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) (or (forall ((v_ArrVal_10881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10879 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10876))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10877) .cse6 v_ArrVal_10879) (select (select (store .cse7 .cse6 v_ArrVal_10878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10881))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5)))) (forall ((|v_ULTIMATE.start_main_#t~malloc41#1.base_18| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc41#1.base_18|))))))) is different from false