./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/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_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/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_65f0a9bb-a957-44f8-9085-a68b3046c46f/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 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:17:38,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:17:38,499 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 06:17:38,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:17:38,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:17:38,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:17:38,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:17:38,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:17:38,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:17:38,532 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:17:38,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:17:38,534 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:17:38,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:17:38,535 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:17:38,535 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:17:38,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:17:38,537 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:17:38,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:17:38,538 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:17:38,538 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:17:38,539 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:17:38,541 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:17:38,542 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:17:38,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:17:38,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:17:38,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:17:38,543 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:17:38,544 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:17:38,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:17:38,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:17:38,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:17:38,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:17:38,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:17:38,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:17:38,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:17:38,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:17:38,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:17:38,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:17:38,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:17:38,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:17:38,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:17:38,548 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_65f0a9bb-a957-44f8-9085-a68b3046c46f/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_65f0a9bb-a957-44f8-9085-a68b3046c46f/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 -> 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 [2023-11-29 06:17:38,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:17:38,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:17:38,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:17:38,814 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:17:38,815 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:17:38,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2023-11-29 06:17:41,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:17:42,191 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:17:42,192 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2023-11-29 06:17:42,210 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data/4c7fd20c6/0c98c89f4cd443d181d87a398e2ee5c4/FLAGea64dc37b [2023-11-29 06:17:42,225 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data/4c7fd20c6/0c98c89f4cd443d181d87a398e2ee5c4 [2023-11-29 06:17:42,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:17:42,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:17:42,230 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:17:42,231 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:17:42,236 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:17:42,237 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:17:42" (1/1) ... [2023-11-29 06:17:42,238 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42a73fc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:42, skipping insertion in model container [2023-11-29 06:17:42,238 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:17:42" (1/1) ... [2023-11-29 06:17:42,302 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:17:42,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:17:42,936 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 06:17:42,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@22c08f5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:42, skipping insertion in model container [2023-11-29 06:17:42,937 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:17:42,938 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 06:17:42,939 INFO L158 Benchmark]: Toolchain (without parser) took 709.69ms. Allocated memory is still 159.4MB. Free memory was 127.6MB in the beginning and 104.5MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 06:17:42,940 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:17:42,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 707.26ms. Allocated memory is still 159.4MB. Free memory was 127.2MB in the beginning and 104.5MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 06:17:42,942 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 121.6MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 707.26ms. Allocated memory is still 159.4MB. Free memory was 127.2MB in the beginning and 104.5MB in the end (delta: 22.7MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/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_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/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_65f0a9bb-a957-44f8-9085-a68b3046c46f/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 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:17:44,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:17:44,894 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 06:17:44,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:17:44,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:17:44,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:17:44,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:17:44,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:17:44,930 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:17:44,930 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:17:44,931 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:17:44,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:17:44,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:17:44,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:17:44,934 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:17:44,934 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:17:44,935 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:17:44,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:17:44,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:17:44,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:17:44,937 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 06:17:44,938 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 06:17:44,938 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 06:17:44,939 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:17:44,939 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:17:44,940 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:17:44,940 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:17:44,941 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 06:17:44,941 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:17:44,941 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:17:44,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:17:44,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:17:44,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:17:44,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:17:44,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:17:44,943 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:17:44,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:17:44,944 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:17:44,944 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:17:44,944 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:17:44,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:17:44,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:17:44,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:17:44,945 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:17:44,945 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_65f0a9bb-a957-44f8-9085-a68b3046c46f/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_65f0a9bb-a957-44f8-9085-a68b3046c46f/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 -> 3a97724240a87192496d8328468f54cf5b25ba6881d4dae32505036169c4a273 [2023-11-29 06:17:45,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:17:45,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:17:45,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:17:45,276 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:17:45,276 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:17:45,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2023-11-29 06:17:48,429 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:17:48,714 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:17:48,715 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test5-1.i [2023-11-29 06:17:48,732 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data/77363dda8/af3a79a4f1524069917b582be78b855a/FLAGbfb30fd48 [2023-11-29 06:17:48,747 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/data/77363dda8/af3a79a4f1524069917b582be78b855a [2023-11-29 06:17:48,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:17:48,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:17:48,753 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:17:48,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:17:48,758 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:17:48,759 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:17:48" (1/1) ... [2023-11-29 06:17:48,760 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e919966 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:48, skipping insertion in model container [2023-11-29 06:17:48,760 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:17:48" (1/1) ... [2023-11-29 06:17:48,836 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:17:49,376 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:17:49,392 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 06:17:49,406 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:17:49,518 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:17:49,523 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:17:49,624 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:17:49,669 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 06:17:49,703 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:17:49,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49 WrapperNode [2023-11-29 06:17:49,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:17:49,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:17:49,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:17:49,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:17:49,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:49,755 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:49,830 INFO L138 Inliner]: procedures = 180, calls = 390, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1418 [2023-11-29 06:17:49,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:17:49,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:17:49,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:17:49,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:17:49,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:49,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:49,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:49,989 INFO L175 MemorySlicer]: Split 359 memory accesses to 5 slices as follows [2, 24, 5, 323, 5]. 90 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 85 writes are split as follows [0, 1, 1, 82, 1]. [2023-11-29 06:17:49,990 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:49,990 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:50,049 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:50,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:50,072 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:50,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:50,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:17:50,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:17:50,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:17:50,096 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:17:50,097 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (1/1) ... [2023-11-29 06:17:50,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:17:50,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:17:50,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:17:50,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:17:50,178 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 06:17:50,179 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 06:17:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:17:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:17:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:17:50,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 06:17:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 06:17:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 06:17:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 06:17:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 06:17:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 06:17:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 06:17:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 06:17:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 06:17:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 06:17:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 06:17:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 06:17:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 06:17:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2023-11-29 06:17:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 06:17:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 06:17:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 06:17:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 06:17:50,183 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2023-11-29 06:17:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 06:17:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 06:17:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 06:17:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 06:17:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 06:17:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 06:17:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 06:17:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 06:17:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:17:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:17:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:17:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:17:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 06:17:50,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:17:50,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:17:50,478 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:17:50,481 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:17:50,510 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:17:50,548 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:17:50,571 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:17:50,596 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:17:50,619 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 06:17:56,895 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:17:57,122 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:17:57,122 INFO L309 CfgBuilder]: Removed 83 assume(true) statements. [2023-11-29 06:17:57,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:17:57 BoogieIcfgContainer [2023-11-29 06:17:57,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:17:57,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:17:57,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:17:57,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:17:57,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:17:48" (1/3) ... [2023-11-29 06:17:57,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce3361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:17:57, skipping insertion in model container [2023-11-29 06:17:57,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:17:49" (2/3) ... [2023-11-29 06:17:57,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ce3361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:17:57, skipping insertion in model container [2023-11-29 06:17:57,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:17:57" (3/3) ... [2023-11-29 06:17:57,132 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test5-1.i [2023-11-29 06:17:57,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:17:57,152 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 728 error locations. [2023-11-29 06:17:57,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:17:57,233 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;@4ba664ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:17:57,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 728 error locations. [2023-11-29 06:17:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 1324 states, 585 states have (on average 2.517948717948718) internal successors, (1473), 1314 states have internal predecessors, (1473), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-29 06:17:57,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:17:57,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:17:57,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:17:57,252 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:17:57,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:17:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 70757696, now seen corresponding path program 1 times [2023-11-29 06:17:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:17:57,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228182297] [2023-11-29 06:17:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:17:57,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:17:57,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:17:57,285 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:17:57,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 06:17:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:17:57,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:17:57,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:17:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:17:57,532 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:17:57,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:17:57,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228182297] [2023-11-29 06:17:57,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228182297] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:17:57,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:17:57,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:17:57,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484049838] [2023-11-29 06:17:57,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:17:57,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:17:57,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:17:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:17:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:17:57,578 INFO L87 Difference]: Start difference. First operand has 1324 states, 585 states have (on average 2.517948717948718) internal successors, (1473), 1314 states have internal predecessors, (1473), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) 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 06:17:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:17:58,538 INFO L93 Difference]: Finished difference Result 1304 states and 1386 transitions. [2023-11-29 06:17:58,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:17:58,541 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 06:17:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:17:58,557 INFO L225 Difference]: With dead ends: 1304 [2023-11-29 06:17:58,557 INFO L226 Difference]: Without dead ends: 1303 [2023-11-29 06:17:58,559 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 06:17:58,561 INFO L413 NwaCegarLoop]: 1242 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:17:58,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1242 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 06:17:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2023-11-29 06:17:58,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1303. [2023-11-29 06:17:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 576 states have (on average 2.3628472222222223) internal successors, (1361), 1293 states have internal predecessors, (1361), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:17:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 1385 transitions. [2023-11-29 06:17:58,640 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 1385 transitions. Word has length 4 [2023-11-29 06:17:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:17:58,640 INFO L495 AbstractCegarLoop]: Abstraction has 1303 states and 1385 transitions. [2023-11-29 06:17:58,640 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 06:17:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 1385 transitions. [2023-11-29 06:17:58,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:17:58,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:17:58,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:17:58,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:17:58,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:17:58,842 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:17:58,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:17:58,843 INFO L85 PathProgramCache]: Analyzing trace with hash 70757758, now seen corresponding path program 1 times [2023-11-29 06:17:58,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:17:58,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [785045536] [2023-11-29 06:17:58,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:17:58,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:17:58,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:17:58,846 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:17:58,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 06:17:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:17:58,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:17:58,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:17:59,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:17:59,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:17:59,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:17:59,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:17:59,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [785045536] [2023-11-29 06:17:59,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [785045536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:17:59,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:17:59,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:17:59,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945372215] [2023-11-29 06:17:59,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:17:59,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:17:59,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:17:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:17:59,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:17:59,062 INFO L87 Difference]: Start difference. First operand 1303 states and 1385 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 06:18:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:02,346 INFO L93 Difference]: Finished difference Result 1532 states and 1658 transitions. [2023-11-29 06:18:02,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:18:02,347 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 06:18:02,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:02,355 INFO L225 Difference]: With dead ends: 1532 [2023-11-29 06:18:02,355 INFO L226 Difference]: Without dead ends: 1532 [2023-11-29 06:18:02,355 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 06:18:02,356 INFO L413 NwaCegarLoop]: 778 mSDtfsCounter, 1235 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:02,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1014 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 06:18:02,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2023-11-29 06:18:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1278. [2023-11-29 06:18:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 642 states have (on average 2.1728971962616823) internal successors, (1395), 1268 states have internal predecessors, (1395), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1419 transitions. [2023-11-29 06:18:02,408 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1419 transitions. Word has length 4 [2023-11-29 06:18:02,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:02,408 INFO L495 AbstractCegarLoop]: Abstraction has 1278 states and 1419 transitions. [2023-11-29 06:18:02,408 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 06:18:02,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1419 transitions. [2023-11-29 06:18:02,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 06:18:02,409 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:02,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 06:18:02,412 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:18:02,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:02,612 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:02,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash 70757759, now seen corresponding path program 1 times [2023-11-29 06:18:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:02,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320845391] [2023-11-29 06:18:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:02,613 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:02,613 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:02,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:02,615 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:18:02,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:02,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:18:02,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:02,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:18:02,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:02,748 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:02,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:02,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320845391] [2023-11-29 06:18:02,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320845391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:02,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:02,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:18:02,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968700054] [2023-11-29 06:18:02,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:02,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:18:02,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:02,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:18:02,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:18:02,750 INFO L87 Difference]: Start difference. First operand 1278 states and 1419 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 06:18:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:07,637 INFO L93 Difference]: Finished difference Result 1749 states and 1940 transitions. [2023-11-29 06:18:07,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:18:07,638 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 06:18:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:07,646 INFO L225 Difference]: With dead ends: 1749 [2023-11-29 06:18:07,646 INFO L226 Difference]: Without dead ends: 1749 [2023-11-29 06:18:07,647 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 06:18:07,648 INFO L413 NwaCegarLoop]: 1107 mSDtfsCounter, 675 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1598 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:07,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1598 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-11-29 06:18:07,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2023-11-29 06:18:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1401. [2023-11-29 06:18:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 775 states have (on average 2.152258064516129) internal successors, (1668), 1391 states have internal predecessors, (1668), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1692 transitions. [2023-11-29 06:18:07,700 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1692 transitions. Word has length 4 [2023-11-29 06:18:07,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:07,700 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1692 transitions. [2023-11-29 06:18:07,700 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 06:18:07,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1692 transitions. [2023-11-29 06:18:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 06:18:07,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:07,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 06:18:07,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:18:07,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:07,902 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:07,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:07,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2099785487, now seen corresponding path program 1 times [2023-11-29 06:18:07,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874293952] [2023-11-29 06:18:07,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:07,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:07,904 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:07,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:07,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 06:18:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:08,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:18:08,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:08,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:08,049 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:08,049 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:08,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874293952] [2023-11-29 06:18:08,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874293952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:08,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:08,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:18:08,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571063292] [2023-11-29 06:18:08,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:08,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:18:08,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:08,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:18:08,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:18:08,051 INFO L87 Difference]: Start difference. First operand 1401 states and 1692 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 06:18:09,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:09,822 INFO L93 Difference]: Finished difference Result 2786 states and 3368 transitions. [2023-11-29 06:18:09,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:18:09,825 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 06:18:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:09,842 INFO L225 Difference]: With dead ends: 2786 [2023-11-29 06:18:09,842 INFO L226 Difference]: Without dead ends: 2786 [2023-11-29 06:18:09,843 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 06:18:09,844 INFO L413 NwaCegarLoop]: 1134 mSDtfsCounter, 1243 mSDsluCounter, 1131 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:09,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 2265 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:18:09,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2023-11-29 06:18:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1403. [2023-11-29 06:18:09,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1403 states, 777 states have (on average 2.1492921492921493) internal successors, (1670), 1393 states have internal predecessors, (1670), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:09,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1403 states to 1403 states and 1694 transitions. [2023-11-29 06:18:09,900 INFO L78 Accepts]: Start accepts. Automaton has 1403 states and 1694 transitions. Word has length 5 [2023-11-29 06:18:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:09,901 INFO L495 AbstractCegarLoop]: Abstraction has 1403 states and 1694 transitions. [2023-11-29 06:18:09,901 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 06:18:09,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1403 states and 1694 transitions. [2023-11-29 06:18:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 06:18:09,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:09,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:18:09,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 06:18:10,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:10,105 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:10,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:10,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1404939320, now seen corresponding path program 1 times [2023-11-29 06:18:10,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:10,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209971922] [2023-11-29 06:18:10,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:10,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:10,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:10,108 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:10,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 06:18:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:10,298 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:18:10,300 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:10,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:10,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:10,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209971922] [2023-11-29 06:18:10,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209971922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:10,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:10,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:18:10,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079624185] [2023-11-29 06:18:10,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:10,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:18:10,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:10,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:18:10,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:18:10,310 INFO L87 Difference]: Start difference. First operand 1403 states and 1694 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:11,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:11,381 INFO L93 Difference]: Finished difference Result 1364 states and 1654 transitions. [2023-11-29 06:18:11,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:18:11,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-29 06:18:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:11,389 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 06:18:11,389 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 06:18:11,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:18:11,390 INFO L413 NwaCegarLoop]: 1092 mSDtfsCounter, 70 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:11,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2135 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 06:18:11,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 06:18:11,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1364. [2023-11-29 06:18:11,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 762 states have (on average 2.1391076115485563) internal successors, (1630), 1354 states have internal predecessors, (1630), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 1654 transitions. [2023-11-29 06:18:11,420 INFO L78 Accepts]: Start accepts. Automaton has 1364 states and 1654 transitions. Word has length 10 [2023-11-29 06:18:11,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:11,421 INFO L495 AbstractCegarLoop]: Abstraction has 1364 states and 1654 transitions. [2023-11-29 06:18:11,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1364 states and 1654 transitions. [2023-11-29 06:18:11,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 06:18:11,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:11,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:18:11,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 06:18:11,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:11,622 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:11,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:11,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1526958302, now seen corresponding path program 1 times [2023-11-29 06:18:11,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:11,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840839744] [2023-11-29 06:18:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:11,624 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:11,625 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:11,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 06:18:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:11,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:18:11,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:11,809 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:11,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:11,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840839744] [2023-11-29 06:18:11,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840839744] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:11,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:11,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:18:11,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684849585] [2023-11-29 06:18:11,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:11,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:18:11,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:11,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:18:11,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:11,811 INFO L87 Difference]: Start difference. First operand 1364 states and 1654 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:13,410 INFO L93 Difference]: Finished difference Result 1350 states and 1633 transitions. [2023-11-29 06:18:13,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:18:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 06:18:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:13,417 INFO L225 Difference]: With dead ends: 1350 [2023-11-29 06:18:13,417 INFO L226 Difference]: Without dead ends: 1350 [2023-11-29 06:18:13,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:13,418 INFO L413 NwaCegarLoop]: 1061 mSDtfsCounter, 58 mSDsluCounter, 2098 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3159 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:13,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3159 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 06:18:13,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-11-29 06:18:13,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1349. [2023-11-29 06:18:13,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 761 states have (on average 2.1130091984231276) internal successors, (1608), 1339 states have internal predecessors, (1608), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:13,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1632 transitions. [2023-11-29 06:18:13,438 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1632 transitions. Word has length 12 [2023-11-29 06:18:13,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:13,439 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1632 transitions. [2023-11-29 06:18:13,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1632 transitions. [2023-11-29 06:18:13,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 06:18:13,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:13,440 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] [2023-11-29 06:18:13,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 06:18:13,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:13,641 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:13,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1678685040, now seen corresponding path program 1 times [2023-11-29 06:18:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:13,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182678594] [2023-11-29 06:18:13,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:13,642 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:13,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:13,643 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:13,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 06:18:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:13,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:18:13,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:13,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:18:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:13,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:13,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:13,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182678594] [2023-11-29 06:18:13,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182678594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:13,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:13,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:18:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14028100] [2023-11-29 06:18:13,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:13,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:18:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:13,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:18:13,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:13,897 INFO L87 Difference]: Start difference. First operand 1349 states and 1632 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:17,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:17,329 INFO L93 Difference]: Finished difference Result 1600 states and 1868 transitions. [2023-11-29 06:18:17,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:18:17,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-29 06:18:17,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:17,337 INFO L225 Difference]: With dead ends: 1600 [2023-11-29 06:18:17,337 INFO L226 Difference]: Without dead ends: 1600 [2023-11-29 06:18:17,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:17,338 INFO L413 NwaCegarLoop]: 540 mSDtfsCounter, 1170 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1249 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:17,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1249 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 06:18:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2023-11-29 06:18:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1345. [2023-11-29 06:18:17,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 761 states have (on average 2.107752956636005) internal successors, (1604), 1335 states have internal predecessors, (1604), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1628 transitions. [2023-11-29 06:18:17,376 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1628 transitions. Word has length 26 [2023-11-29 06:18:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:17,376 INFO L495 AbstractCegarLoop]: Abstraction has 1345 states and 1628 transitions. [2023-11-29 06:18:17,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:17,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1628 transitions. [2023-11-29 06:18:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 06:18:17,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:17,378 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] [2023-11-29 06:18:17,382 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 06:18:17,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:17,582 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:17,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:17,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1678685039, now seen corresponding path program 1 times [2023-11-29 06:18:17,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:17,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177808536] [2023-11-29 06:18:17,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:17,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:17,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:17,584 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:17,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 06:18:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:17,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:18:17,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:17,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:18:17,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:17,936 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:17,936 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177808536] [2023-11-29 06:18:17,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177808536] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:17,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:17,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:18:17,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614097312] [2023-11-29 06:18:17,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:17,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:18:17,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:17,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:18:17,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:17,938 INFO L87 Difference]: Start difference. First operand 1345 states and 1628 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:22,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:22,755 INFO L93 Difference]: Finished difference Result 1690 states and 1873 transitions. [2023-11-29 06:18:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:18:22,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2023-11-29 06:18:22,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:22,763 INFO L225 Difference]: With dead ends: 1690 [2023-11-29 06:18:22,763 INFO L226 Difference]: Without dead ends: 1690 [2023-11-29 06:18:22,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:22,764 INFO L413 NwaCegarLoop]: 867 mSDtfsCounter, 612 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 1854 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:22,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [617 Valid, 1854 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2023-11-29 06:18:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2023-11-29 06:18:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1341. [2023-11-29 06:18:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 761 states have (on average 2.102496714848883) internal successors, (1600), 1331 states have internal predecessors, (1600), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1624 transitions. [2023-11-29 06:18:22,791 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1624 transitions. Word has length 26 [2023-11-29 06:18:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:22,791 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1624 transitions. [2023-11-29 06:18:22,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1624 transitions. [2023-11-29 06:18:22,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 06:18:22,793 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:22,793 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] [2023-11-29 06:18:22,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 06:18:22,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:22,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:22,994 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash -316092918, now seen corresponding path program 1 times [2023-11-29 06:18:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:22,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671045190] [2023-11-29 06:18:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:22,995 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:22,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:22,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 06:18:23,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:23,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:18:23,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:23,236 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:23,236 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:23,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671045190] [2023-11-29 06:18:23,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [671045190] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:23,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:23,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:18:23,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793704314] [2023-11-29 06:18:23,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:23,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:18:23,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:23,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:18:23,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:23,238 INFO L87 Difference]: Start difference. First operand 1341 states and 1624 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:24,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:24,497 INFO L93 Difference]: Finished difference Result 1335 states and 1614 transitions. [2023-11-29 06:18:24,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:18:24,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2023-11-29 06:18:24,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:24,504 INFO L225 Difference]: With dead ends: 1335 [2023-11-29 06:18:24,504 INFO L226 Difference]: Without dead ends: 1335 [2023-11-29 06:18:24,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:24,505 INFO L413 NwaCegarLoop]: 1055 mSDtfsCounter, 23 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3145 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:24,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3145 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 06:18:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2023-11-29 06:18:24,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2023-11-29 06:18:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 755 states have (on average 2.1059602649006623) internal successors, (1590), 1325 states have internal predecessors, (1590), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:24,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1614 transitions. [2023-11-29 06:18:24,535 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1614 transitions. Word has length 42 [2023-11-29 06:18:24,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:24,535 INFO L495 AbstractCegarLoop]: Abstraction has 1335 states and 1614 transitions. [2023-11-29 06:18:24,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:24,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1614 transitions. [2023-11-29 06:18:24,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 06:18:24,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:24,537 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] [2023-11-29 06:18:24,542 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 06:18:24,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:24,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:24,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:24,739 INFO L85 PathProgramCache]: Analyzing trace with hash -449345878, now seen corresponding path program 1 times [2023-11-29 06:18:24,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:24,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280992250] [2023-11-29 06:18:24,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:24,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:24,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:24,741 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:24,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 06:18:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:24,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:18:24,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:25,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:25,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:25,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:25,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280992250] [2023-11-29 06:18:25,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280992250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:25,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:25,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:18:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705601386] [2023-11-29 06:18:25,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:25,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:18:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:18:25,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:18:25,206 INFO L87 Difference]: Start difference. First operand 1335 states and 1614 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:26,222 INFO L93 Difference]: Finished difference Result 1378 states and 1657 transitions. [2023-11-29 06:18:26,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:18:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2023-11-29 06:18:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:26,231 INFO L225 Difference]: With dead ends: 1378 [2023-11-29 06:18:26,231 INFO L226 Difference]: Without dead ends: 1378 [2023-11-29 06:18:26,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:18:26,232 INFO L413 NwaCegarLoop]: 1070 mSDtfsCounter, 59 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:26,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2062 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 06:18:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-29 06:18:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-11-29 06:18:26,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 798 states have (on average 2.0463659147869673) internal successors, (1633), 1368 states have internal predecessors, (1633), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:26,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1657 transitions. [2023-11-29 06:18:26,256 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1657 transitions. Word has length 46 [2023-11-29 06:18:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:26,257 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1657 transitions. [2023-11-29 06:18:26,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:26,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1657 transitions. [2023-11-29 06:18:26,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 06:18:26,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:26,259 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] [2023-11-29 06:18:26,264 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-29 06:18:26,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:26,464 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:26,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:26,465 INFO L85 PathProgramCache]: Analyzing trace with hash 842573049, now seen corresponding path program 1 times [2023-11-29 06:18:26,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:26,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947766913] [2023-11-29 06:18:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:26,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:26,466 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:26,467 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 06:18:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:26,788 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 06:18:26,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:26,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:18:26,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:18:27,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 06:18:27,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 06:18:27,291 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:18:27,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:18:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:27,308 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:27,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1947766913] [2023-11-29 06:18:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1947766913] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:27,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:27,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:18:27,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020591515] [2023-11-29 06:18:27,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:27,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:18:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:18:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:27,310 INFO L87 Difference]: Start difference. First operand 1378 states and 1657 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:31,000 INFO L93 Difference]: Finished difference Result 1548 states and 1812 transitions. [2023-11-29 06:18:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:18:31,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 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 49 [2023-11-29 06:18:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:31,007 INFO L225 Difference]: With dead ends: 1548 [2023-11-29 06:18:31,007 INFO L226 Difference]: Without dead ends: 1548 [2023-11-29 06:18:31,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:31,007 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 1380 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:31,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 458 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 06:18:31,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2023-11-29 06:18:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1161. [2023-11-29 06:18:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 665 states have (on average 1.9022556390977443) internal successors, (1265), 1151 states have internal predecessors, (1265), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1289 transitions. [2023-11-29 06:18:31,029 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1289 transitions. Word has length 49 [2023-11-29 06:18:31,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:31,030 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1289 transitions. [2023-11-29 06:18:31,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:31,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1289 transitions. [2023-11-29 06:18:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 06:18:31,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:31,030 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] [2023-11-29 06:18:31,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 06:18:31,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:31,231 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:31,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash -604104386, now seen corresponding path program 1 times [2023-11-29 06:18:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:31,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231278296] [2023-11-29 06:18:31,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:31,233 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:31,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 06:18:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:31,456 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 06:18:31,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:31,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:18:31,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:18:31,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 06:18:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:31,521 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:31,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:31,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231278296] [2023-11-29 06:18:31,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231278296] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:31,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:31,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:18:31,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976520203] [2023-11-29 06:18:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:31,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:18:31,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:31,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:18:31,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:31,523 INFO L87 Difference]: Start difference. First operand 1161 states and 1289 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:34,991 INFO L93 Difference]: Finished difference Result 1160 states and 1288 transitions. [2023-11-29 06:18:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:18:34,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2023-11-29 06:18:34,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:34,996 INFO L225 Difference]: With dead ends: 1160 [2023-11-29 06:18:34,997 INFO L226 Difference]: Without dead ends: 1160 [2023-11-29 06:18:34,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:18:34,997 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 3 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1905 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 1906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:34,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2562 Invalid, 1906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1905 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 06:18:35,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-11-29 06:18:35,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1160. [2023-11-29 06:18:35,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1160 states, 665 states have (on average 1.9007518796992482) internal successors, (1264), 1150 states have internal predecessors, (1264), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:35,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1160 states to 1160 states and 1288 transitions. [2023-11-29 06:18:35,012 INFO L78 Accepts]: Start accepts. Automaton has 1160 states and 1288 transitions. Word has length 53 [2023-11-29 06:18:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:35,012 INFO L495 AbstractCegarLoop]: Abstraction has 1160 states and 1288 transitions. [2023-11-29 06:18:35,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 1160 states and 1288 transitions. [2023-11-29 06:18:35,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 06:18:35,013 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:35,013 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] [2023-11-29 06:18:35,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 06:18:35,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:35,214 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:35,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -604104385, now seen corresponding path program 1 times [2023-11-29 06:18:35,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:35,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367422508] [2023-11-29 06:18:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:35,215 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:35,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:35,216 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:35,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 06:18:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:35,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 06:18:35,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:35,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:18:35,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 06:18:35,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:18:35,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 06:18:35,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:35,557 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:35,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:35,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367422508] [2023-11-29 06:18:35,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367422508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:35,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:35,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:18:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549789414] [2023-11-29 06:18:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:35,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:18:35,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:35,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:18:35,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:35,560 INFO L87 Difference]: Start difference. First operand 1160 states and 1288 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:40,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:40,559 INFO L93 Difference]: Finished difference Result 1159 states and 1287 transitions. [2023-11-29 06:18:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:18:40,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 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 53 [2023-11-29 06:18:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:40,564 INFO L225 Difference]: With dead ends: 1159 [2023-11-29 06:18:40,564 INFO L226 Difference]: Without dead ends: 1159 [2023-11-29 06:18:40,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:18:40,564 INFO L413 NwaCegarLoop]: 983 mSDtfsCounter, 1 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2592 SdHoareTripleChecker+Invalid, 1874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:40,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2592 Invalid, 1874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 06:18:40,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2023-11-29 06:18:40,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1159. [2023-11-29 06:18:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1159 states, 664 states have (on average 1.9021084337349397) internal successors, (1263), 1149 states have internal predecessors, (1263), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-29 06:18:40,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1159 states to 1159 states and 1287 transitions. [2023-11-29 06:18:40,579 INFO L78 Accepts]: Start accepts. Automaton has 1159 states and 1287 transitions. Word has length 53 [2023-11-29 06:18:40,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:40,579 INFO L495 AbstractCegarLoop]: Abstraction has 1159 states and 1287 transitions. [2023-11-29 06:18:40,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 06:18:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1159 states and 1287 transitions. [2023-11-29 06:18:40,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 06:18:40,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:40,580 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] [2023-11-29 06:18:40,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:18:40,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:40,780 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:40,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:40,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1551888158, now seen corresponding path program 1 times [2023-11-29 06:18:40,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:40,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338983322] [2023-11-29 06:18:40,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:40,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:40,782 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:40,782 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:40,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 06:18:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:41,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:18:41,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:41,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:18:41,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338983322] [2023-11-29 06:18:41,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338983322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:18:41,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:18:41,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:18:41,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878177387] [2023-11-29 06:18:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:18:41,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:18:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:41,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:18:41,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:18:41,061 INFO L87 Difference]: Start difference. First operand 1159 states and 1287 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:18:42,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:42,355 INFO L93 Difference]: Finished difference Result 1161 states and 1291 transitions. [2023-11-29 06:18:42,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:18:42,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 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 59 [2023-11-29 06:18:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:42,361 INFO L225 Difference]: With dead ends: 1161 [2023-11-29 06:18:42,361 INFO L226 Difference]: Without dead ends: 1161 [2023-11-29 06:18:42,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:18:42,362 INFO L413 NwaCegarLoop]: 982 mSDtfsCounter, 1 mSDsluCounter, 1958 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:42,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2940 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 06:18:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2023-11-29 06:18:42,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 1161. [2023-11-29 06:18:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 665 states have (on average 1.9022556390977443) internal successors, (1265), 1151 states have internal predecessors, (1265), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:18:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1291 transitions. [2023-11-29 06:18:42,380 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1291 transitions. Word has length 59 [2023-11-29 06:18:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:42,380 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1291 transitions. [2023-11-29 06:18:42,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:18:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1291 transitions. [2023-11-29 06:18:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 06:18:42,381 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:42,381 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 06:18:42,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 06:18:42,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:42,582 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:42,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash -2113434901, now seen corresponding path program 1 times [2023-11-29 06:18:42,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294846643] [2023-11-29 06:18:42,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:18:42,583 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:42,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:42,584 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:42,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 06:18:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:18:42,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:18:42,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:42,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:42,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:18:42,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:42,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:42,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294846643] [2023-11-29 06:18:42,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294846643] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:18:42,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:18:42,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 06:18:42,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986077707] [2023-11-29 06:18:42,896 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:18:42,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:18:42,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:42,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:18:42,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:18:42,898 INFO L87 Difference]: Start difference. First operand 1161 states and 1291 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:18:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:44,563 INFO L93 Difference]: Finished difference Result 1170 states and 1306 transitions. [2023-11-29 06:18:44,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:18:44,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 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 60 [2023-11-29 06:18:44,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:44,569 INFO L225 Difference]: With dead ends: 1170 [2023-11-29 06:18:44,569 INFO L226 Difference]: Without dead ends: 1170 [2023-11-29 06:18:44,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:18:44,570 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 6 mSDsluCounter, 2930 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3910 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:44,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3910 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 06:18:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2023-11-29 06:18:44,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1169. [2023-11-29 06:18:44,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 672 states have (on average 1.9017857142857142) internal successors, (1278), 1158 states have internal predecessors, (1278), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:18:44,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1304 transitions. [2023-11-29 06:18:44,585 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1304 transitions. Word has length 60 [2023-11-29 06:18:44,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:44,586 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1304 transitions. [2023-11-29 06:18:44,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:18:44,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1304 transitions. [2023-11-29 06:18:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 06:18:44,586 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:44,586 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] [2023-11-29 06:18:44,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 06:18:44,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:44,787 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:44,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:44,787 INFO L85 PathProgramCache]: Analyzing trace with hash -963458270, now seen corresponding path program 2 times [2023-11-29 06:18:44,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:44,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188965243] [2023-11-29 06:18:44,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 06:18:44,788 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:44,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:44,789 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:44,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 06:18:45,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 06:18:45,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:18:45,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:18:45,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:45,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:18:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:45,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:45,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188965243] [2023-11-29 06:18:45,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [188965243] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:18:45,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:18:45,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 06:18:45,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256274613] [2023-11-29 06:18:45,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:18:45,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 06:18:45,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:45,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 06:18:45,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:18:45,388 INFO L87 Difference]: Start difference. First operand 1169 states and 1304 transitions. Second operand has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:18:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:48,020 INFO L93 Difference]: Finished difference Result 1184 states and 1330 transitions. [2023-11-29 06:18:48,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:18:48,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 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 63 [2023-11-29 06:18:48,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:48,027 INFO L225 Difference]: With dead ends: 1184 [2023-11-29 06:18:48,027 INFO L226 Difference]: Without dead ends: 1182 [2023-11-29 06:18:48,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2023-11-29 06:18:48,027 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 12 mSDsluCounter, 4890 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5870 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:48,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5870 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 06:18:48,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2023-11-29 06:18:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1178. [2023-11-29 06:18:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 681 states have (on average 1.894273127753304) internal successors, (1290), 1167 states have internal predecessors, (1290), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:18:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1316 transitions. [2023-11-29 06:18:48,043 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1316 transitions. Word has length 63 [2023-11-29 06:18:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:48,043 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1316 transitions. [2023-11-29 06:18:48,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.583333333333333) internal successors, (67), 14 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:18:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1316 transitions. [2023-11-29 06:18:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 06:18:48,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:48,044 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] [2023-11-29 06:18:48,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 06:18:48,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:48,244 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:48,244 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1410693502, now seen corresponding path program 3 times [2023-11-29 06:18:48,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:48,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953723857] [2023-11-29 06:18:48,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 06:18:48,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:48,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:48,246 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:48,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 06:18:48,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 06:18:48,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:18:48,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:18:48,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:48,978 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:18:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:49,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:49,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953723857] [2023-11-29 06:18:49,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953723857] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:18:49,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:18:49,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 06:18:49,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719843751] [2023-11-29 06:18:49,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:18:49,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:18:49,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:49,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:18:49,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 06:18:49,621 INFO L87 Difference]: Start difference. First operand 1178 states and 1316 transitions. Second operand has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:18:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:18:56,592 INFO L93 Difference]: Finished difference Result 1208 states and 1380 transitions. [2023-11-29 06:18:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 06:18:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 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 69 [2023-11-29 06:18:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:18:56,597 INFO L225 Difference]: With dead ends: 1208 [2023-11-29 06:18:56,597 INFO L226 Difference]: Without dead ends: 1205 [2023-11-29 06:18:56,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2023-11-29 06:18:56,598 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 24 mSDsluCounter, 11706 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12684 SdHoareTripleChecker+Invalid, 2667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:18:56,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12684 Invalid, 2667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2642 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-11-29 06:18:56,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-29 06:18:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1196. [2023-11-29 06:18:56,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 699 states have (on average 1.8783977110157368) internal successors, (1313), 1185 states have internal predecessors, (1313), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:18:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1339 transitions. [2023-11-29 06:18:56,615 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1339 transitions. Word has length 69 [2023-11-29 06:18:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:18:56,616 INFO L495 AbstractCegarLoop]: Abstraction has 1196 states and 1339 transitions. [2023-11-29 06:18:56,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 26 states have internal predecessors, (79), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:18:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1339 transitions. [2023-11-29 06:18:56,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 06:18:56,616 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:18:56,617 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] [2023-11-29 06:18:56,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:18:56,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:56,817 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:18:56,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:18:56,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1185290942, now seen corresponding path program 4 times [2023-11-29 06:18:56,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:18:56,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [668521008] [2023-11-29 06:18:56,818 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 06:18:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:18:56,819 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:18:56,819 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:18:56,820 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 06:18:57,214 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 06:18:57,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:18:57,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:18:57,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:18:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:57,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:18:59,007 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 06:18:59,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:18:59,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [668521008] [2023-11-29 06:18:59,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [668521008] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 06:18:59,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:18:59,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 06:18:59,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944028069] [2023-11-29 06:18:59,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:18:59,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 06:18:59,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:18:59,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 06:18:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 06:18:59,010 INFO L87 Difference]: Start difference. First operand 1196 states and 1339 transitions. Second operand has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:19:15,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:19:15,655 INFO L93 Difference]: Finished difference Result 1253 states and 1449 transitions. [2023-11-29 06:19:15,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 06:19:15,656 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 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 81 [2023-11-29 06:19:15,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:19:15,661 INFO L225 Difference]: With dead ends: 1253 [2023-11-29 06:19:15,661 INFO L226 Difference]: Without dead ends: 1251 [2023-11-29 06:19:15,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2023-11-29 06:19:15,665 INFO L413 NwaCegarLoop]: 980 mSDtfsCounter, 47 mSDsluCounter, 24446 mSDsCounter, 0 mSdLazyCounter, 6445 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 25426 SdHoareTripleChecker+Invalid, 6530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 6445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:19:15,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 25426 Invalid, 6530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [85 Valid, 6445 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2023-11-29 06:19:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2023-11-29 06:19:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1230. [2023-11-29 06:19:15,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 733 states have (on average 1.854024556616644) internal successors, (1359), 1219 states have internal predecessors, (1359), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:19:15,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1385 transitions. [2023-11-29 06:19:15,688 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1385 transitions. Word has length 81 [2023-11-29 06:19:15,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:19:15,688 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1385 transitions. [2023-11-29 06:19:15,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.1458333333333335) internal successors, (103), 50 states have internal predecessors, (103), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 06:19:15,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1385 transitions. [2023-11-29 06:19:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 06:19:15,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:19:15,689 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] [2023-11-29 06:19:15,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 06:19:15,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:19:15,890 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:19:15,891 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:19:15,891 INFO L85 PathProgramCache]: Analyzing trace with hash -604622430, now seen corresponding path program 5 times [2023-11-29 06:19:15,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:19:15,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60160028] [2023-11-29 06:19:15,892 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:19:15,892 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:19:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:19:15,893 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:19:15,894 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 06:19:17,209 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:19:17,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:19:17,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 06:19:17,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:19:17,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:19:17,335 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:19:17,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 06:19:17,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:19:17,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 06:19:18,432 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:19:18,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:19:18,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 06:19:18,504 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:19:18,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:19:22,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:19:22,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60160028] [2023-11-29 06:19:22,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60160028] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:19:22,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1500937254] [2023-11-29 06:19:22,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 06:19:22,911 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:19:22,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:19:22,912 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:19:22,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 06:20:18,599 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 06:20:18,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 06:20:18,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 06:20:18,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:20:18,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 06:20:19,082 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:20:19,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:20:19,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:20:19,810 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:20:19,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:20:19,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 06:20:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:20:19,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:20:20,335 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 06:20:20,335 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 25 treesize of output 24 [2023-11-29 06:20:20,343 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2131 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2131) |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 06:20:20,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1500937254] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:20:20,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:20:20,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 17 [2023-11-29 06:20:20,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561527867] [2023-11-29 06:20:20,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:20:20,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 06:20:20,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:20:20,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 06:20:20,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=327, Unknown=2, NotChecked=36, Total=420 [2023-11-29 06:20:20,347 INFO L87 Difference]: Start difference. First operand 1230 states and 1385 transitions. Second operand has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 06:20:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:20:36,216 INFO L93 Difference]: Finished difference Result 2029 states and 2219 transitions. [2023-11-29 06:20:36,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 06:20:36,217 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 103 [2023-11-29 06:20:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:20:36,223 INFO L225 Difference]: With dead ends: 2029 [2023-11-29 06:20:36,223 INFO L226 Difference]: Without dead ends: 2027 [2023-11-29 06:20:36,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=104, Invalid=548, Unknown=2, NotChecked=48, Total=702 [2023-11-29 06:20:36,224 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 1551 mSDsluCounter, 5681 mSDsCounter, 0 mSdLazyCounter, 7462 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 7502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 7462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2023-11-29 06:20:36,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 6199 Invalid, 7502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 7462 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2023-11-29 06:20:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2023-11-29 06:20:36,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1276. [2023-11-29 06:20:36,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 779 states have (on average 1.803594351732991) internal successors, (1405), 1264 states have internal predecessors, (1405), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:20:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1431 transitions. [2023-11-29 06:20:36,244 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1431 transitions. Word has length 103 [2023-11-29 06:20:36,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:20:36,245 INFO L495 AbstractCegarLoop]: Abstraction has 1276 states and 1431 transitions. [2023-11-29 06:20:36,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.8) internal successors, (117), 17 states have internal predecessors, (117), 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 06:20:36,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1431 transitions. [2023-11-29 06:20:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 06:20:36,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:20:36,246 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:20:36,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 06:20:36,473 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-11-29 06:20:36,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:20:36,647 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:20:36,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:20:36,647 INFO L85 PathProgramCache]: Analyzing trace with hash -604622429, now seen corresponding path program 1 times [2023-11-29 06:20:36,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:20:36,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062557917] [2023-11-29 06:20:36,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:20:36,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:20:36,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:20:36,649 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:20:36,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 06:20:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:20:37,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 108 conjunts are in the unsatisfiable core [2023-11-29 06:20:37,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:20:37,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:20:37,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:20:37,675 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:20:37,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:20:37,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:20:37,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:20:37,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:20:37,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:20:38,613 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:20:38,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:20:38,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:20:38,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:20:38,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:20:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:20:38,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:20:40,170 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2668 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2669 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2668) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:20:40,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:20:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062557917] [2023-11-29 06:20:40,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062557917] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:20:40,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [13726757] [2023-11-29 06:20:40,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:20:40,176 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:20:40,176 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:20:40,177 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:20:40,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 06:22:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:16,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 771 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 06:22:16,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:22:16,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:22:16,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:22:16,782 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:22:16,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:22:16,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:22:16,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:22:16,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:22:16,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:22:17,558 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:22:17,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:22:17,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:22:17,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:22:17,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:22:17,643 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:22:17,643 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:22:18,869 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3206 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3206 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3206) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 06:22:18,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [13726757] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:22:18,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:22:18,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 06:22:18,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197133047] [2023-11-29 06:22:18,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:22:18,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:22:18,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:22:18,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:22:18,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 06:22:18,881 INFO L87 Difference]: Start difference. First operand 1276 states and 1431 transitions. Second operand has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:22:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:22:30,924 INFO L93 Difference]: Finished difference Result 1817 states and 1971 transitions. [2023-11-29 06:22:30,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:22:30,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 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 103 [2023-11-29 06:22:30,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:22:30,929 INFO L225 Difference]: With dead ends: 1817 [2023-11-29 06:22:30,929 INFO L226 Difference]: Without dead ends: 1817 [2023-11-29 06:22:30,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 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 06:22:30,929 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 923 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 4998 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 2473 SdHoareTripleChecker+Invalid, 5009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:22:30,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 2473 Invalid, 5009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 4998 Invalid, 0 Unknown, 0 Unchecked, 11.8s Time] [2023-11-29 06:22:30,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2023-11-29 06:22:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1275. [2023-11-29 06:22:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1275 states, 779 states have (on average 1.8023106546854941) internal successors, (1404), 1263 states have internal predecessors, (1404), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:22:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1430 transitions. [2023-11-29 06:22:30,952 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1430 transitions. Word has length 103 [2023-11-29 06:22:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:22:30,952 INFO L495 AbstractCegarLoop]: Abstraction has 1275 states and 1430 transitions. [2023-11-29 06:22:30,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.428571428571429) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:22:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1430 transitions. [2023-11-29 06:22:30,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:22:30,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:22:30,954 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] [2023-11-29 06:22:30,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 06:22:31,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 06:22:31,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:22:31,355 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:22:31,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:22:31,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1219613938, now seen corresponding path program 1 times [2023-11-29 06:22:31,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:22:31,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474250498] [2023-11-29 06:22:31,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:31,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:22:31,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:22:31,357 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:22:31,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:22:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:32,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 06:22:32,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:22:32,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:22:32,230 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:22:32,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 06:22:32,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:22:32,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 06:22:33,297 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:22:33,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:22:33,408 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:22:33,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:22:33,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 33 treesize of output 15 [2023-11-29 06:22:33,456 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:22:33,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:22:37,567 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:22:37,901 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3661 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3661))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3615)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:22:37,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:22:37,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474250498] [2023-11-29 06:22:37,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474250498] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:22:37,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242665396] [2023-11-29 06:22:37,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:22:37,904 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:22:37,905 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:22:37,905 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:22:37,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 06:22:41,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:22:41,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 06:22:41,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:22:41,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:22:41,601 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:22:41,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:22:41,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:22:42,285 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:22:42,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:22:42,446 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:22:42,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:22:42,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 06:22:42,466 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:22:42,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:22:46,899 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 06:22:46,899 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 37 treesize of output 36 [2023-11-29 06:22:46,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4115 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4115))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3615)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 06:22:46,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242665396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:22:46,913 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:22:46,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-11-29 06:22:46,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041943156] [2023-11-29 06:22:46,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:22:46,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 06:22:46,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:22:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 06:22:46,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=398, Unknown=6, NotChecked=126, Total=600 [2023-11-29 06:22:46,915 INFO L87 Difference]: Start difference. First operand 1275 states and 1430 transitions. Second operand has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 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 06:23:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:23:07,392 INFO L93 Difference]: Finished difference Result 2025 states and 2213 transitions. [2023-11-29 06:23:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:23:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 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 105 [2023-11-29 06:23:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:23:07,397 INFO L225 Difference]: With dead ends: 2025 [2023-11-29 06:23:07,397 INFO L226 Difference]: Without dead ends: 2025 [2023-11-29 06:23:07,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 195 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=130, Invalid=688, Unknown=6, NotChecked=168, Total=992 [2023-11-29 06:23:07,398 INFO L413 NwaCegarLoop]: 517 mSDtfsCounter, 1548 mSDsluCounter, 6655 mSDsCounter, 0 mSdLazyCounter, 8694 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 7172 SdHoareTripleChecker+Invalid, 8734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 8694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:23:07,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 7172 Invalid, 8734 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 8694 Invalid, 0 Unknown, 0 Unchecked, 20.0s Time] [2023-11-29 06:23:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2023-11-29 06:23:07,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1274. [2023-11-29 06:23:07,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 779 states have (on average 1.8010269576379974) internal successors, (1403), 1262 states have internal predecessors, (1403), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:23:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1429 transitions. [2023-11-29 06:23:07,421 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1429 transitions. Word has length 105 [2023-11-29 06:23:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:23:07,421 INFO L495 AbstractCegarLoop]: Abstraction has 1274 states and 1429 transitions. [2023-11-29 06:23:07,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.117647058823529) internal successors, (121), 19 states have internal predecessors, (121), 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 06:23:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1429 transitions. [2023-11-29 06:23:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 06:23:07,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:23:07,423 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] [2023-11-29 06:23:07,438 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 06:23:07,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:23:07,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:23:07,823 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:23:07,824 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:07,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1219613937, now seen corresponding path program 1 times [2023-11-29 06:23:07,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:07,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132708722] [2023-11-29 06:23:07,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:07,825 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:23:07,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:07,825 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:23:07,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:23:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:08,681 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 06:23:08,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:08,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:23:08,949 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:23:08,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:23:08,956 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 06:23:08,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:23:08,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:23:09,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:23:09,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:23:09,733 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:09,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:23:09,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:23:09,850 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:09,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:23:09,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:23:09,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:23:09,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:23:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:23:09,908 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:23:10,067 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:23:10,101 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4568) |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 06:23:11,450 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4569 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4661))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4660) .cse0 v_ArrVal_4568) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_4569) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_4568 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4661 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4660 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4660) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4661) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4568) |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 06:23:11,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2132708722] [2023-11-29 06:23:11,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2132708722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:23:11,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [566499826] [2023-11-29 06:23:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:11,459 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:23:11,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:23:11,460 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:23:11,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 06:23:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:15,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 112 conjunts are in the unsatisfiable core [2023-11-29 06:23:15,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:15,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:23:15,352 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:23:15,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:23:15,365 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 06:23:15,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:23:15,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:23:15,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:23:15,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:23:16,099 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:16,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 50 treesize of output 45 [2023-11-29 06:23:16,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:23:16,196 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:16,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:23:16,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:23:16,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:23:16,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:23:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:23:16,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:23:16,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-11-29 06:23:16,323 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-11-29 06:23:17,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5206) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5207) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5206 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5207 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5114 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5115 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5207))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5206) .cse2 v_ArrVal_5115) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5114) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:23:17,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [566499826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:23:17,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:23:17,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-11-29 06:23:17,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779366136] [2023-11-29 06:23:17,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:23:17,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:23:17,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:17,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:23:17,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=110, Unknown=6, NotChecked=150, Total=306 [2023-11-29 06:23:17,788 INFO L87 Difference]: Start difference. First operand 1274 states and 1429 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:23:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:23:33,989 INFO L93 Difference]: Finished difference Result 1815 states and 1969 transitions. [2023-11-29 06:23:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:23:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 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 105 [2023-11-29 06:23:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:23:33,995 INFO L225 Difference]: With dead ends: 1815 [2023-11-29 06:23:33,995 INFO L226 Difference]: Without dead ends: 1815 [2023-11-29 06:23:33,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=219, Unknown=6, NotChecked=210, Total=506 [2023-11-29 06:23:33,996 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 921 mSDsluCounter, 2493 mSDsCounter, 0 mSdLazyCounter, 6610 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 6621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 6610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2023-11-29 06:23:33,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 3073 Invalid, 6621 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 6610 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2023-11-29 06:23:33,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2023-11-29 06:23:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1273. [2023-11-29 06:23:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 779 states have (on average 1.7997432605905006) internal successors, (1402), 1261 states have internal predecessors, (1402), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:23:34,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1428 transitions. [2023-11-29 06:23:34,025 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1428 transitions. Word has length 105 [2023-11-29 06:23:34,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:23:34,026 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1428 transitions. [2023-11-29 06:23:34,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:23:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1428 transitions. [2023-11-29 06:23:34,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 06:23:34,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:23:34,027 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] [2023-11-29 06:23:34,040 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 06:23:34,236 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:23:34,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:23:34,428 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:23:34,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:23:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 479028180, now seen corresponding path program 1 times [2023-11-29 06:23:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:23:34,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041424839] [2023-11-29 06:23:34,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:23:34,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:23:34,430 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:23:34,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:23:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:35,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 06:23:35,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:35,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:23:35,493 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:23:35,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 06:23:35,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:23:35,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 06:23:36,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:23:36,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:23:36,671 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:23:36,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:23:36,755 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:23:36,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:23:36,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 06:23:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:23:36,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:23:40,930 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5631) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:23:40,945 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5630))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:23:40,961 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5630))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:23:41,357 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5630 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5677 (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 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5677))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5630)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 06:23:41,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:23:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041424839] [2023-11-29 06:23:41,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041424839] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:23:41,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [871033795] [2023-11-29 06:23:41,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:23:41,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:23:41,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:23:41,362 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:23:41,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 06:23:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:23:46,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 06:23:46,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:23:46,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:23:46,607 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:23:46,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:23:46,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:23:47,310 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:47,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:23:47,470 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:47,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:23:47,577 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:23:47,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:23:47,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 06:23:47,591 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:23:47,591 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:23:51,675 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6100))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:23:51,689 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6100))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:23:52,132 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 06:23:52,133 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 61 treesize of output 60 [2023-11-29 06:23:52,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6147 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5631 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6100 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6147))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6100)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5631)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 06:23:52,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [871033795] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:23:52,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:23:52,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 21 [2023-11-29 06:23:52,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640543421] [2023-11-29 06:23:52,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:23:52,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 06:23:52,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:23:52,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 06:23:52,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=482, Unknown=10, NotChecked=350, Total=930 [2023-11-29 06:23:52,149 INFO L87 Difference]: Start difference. First operand 1273 states and 1428 transitions. Second operand has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 06:24:10,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:24:10,039 INFO L93 Difference]: Finished difference Result 2023 states and 2211 transitions. [2023-11-29 06:24:10,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:24:10,040 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 107 [2023-11-29 06:24:10,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:24:10,043 INFO L225 Difference]: With dead ends: 2023 [2023-11-29 06:24:10,043 INFO L226 Difference]: Without dead ends: 2023 [2023-11-29 06:24:10,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 197 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=159, Invalid=851, Unknown=10, NotChecked=462, Total=1482 [2023-11-29 06:24:10,044 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 1546 mSDsluCounter, 6159 mSDsCounter, 0 mSdLazyCounter, 8100 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1567 SdHoareTripleChecker+Valid, 6675 SdHoareTripleChecker+Invalid, 8140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 8100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:24:10,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1567 Valid, 6675 Invalid, 8140 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [40 Valid, 8100 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2023-11-29 06:24:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2023-11-29 06:24:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1272. [2023-11-29 06:24:10,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 779 states have (on average 1.7984595635430038) internal successors, (1401), 1260 states have internal predecessors, (1401), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:24:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1427 transitions. [2023-11-29 06:24:10,067 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1427 transitions. Word has length 107 [2023-11-29 06:24:10,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:24:10,067 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1427 transitions. [2023-11-29 06:24:10,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 6.578947368421052) internal successors, (125), 21 states have internal predecessors, (125), 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 06:24:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1427 transitions. [2023-11-29 06:24:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 06:24:10,068 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:24:10,068 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] [2023-11-29 06:24:10,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 06:24:10,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 06:24:10,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:24:10,469 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:24:10,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:24:10,469 INFO L85 PathProgramCache]: Analyzing trace with hash 479028181, now seen corresponding path program 1 times [2023-11-29 06:24:10,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:24:10,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346580044] [2023-11-29 06:24:10,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:10,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:24:10,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:24:10,471 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:24:10,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:24:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:11,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 06:24:11,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:11,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:24:11,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:24:11,671 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:24:11,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:24:11,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:24:11,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:24:11,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:24:11,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:24:12,502 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:24:12,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:24:12,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:24:12,630 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:24:12,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:24:12,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:24:12,730 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:24:12,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:24:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:24:12,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:24:12,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:24:12,794 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:24:12,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:12,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 06:24:12,991 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:24:13,035 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6616) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6615))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6616) .cse2 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_6618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:24:13,085 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6615))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6616) .cse1 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_6618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_6616) (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_6615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-11-29 06:24:14,384 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6709))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6710) .cse1 v_ArrVal_6616) (select (select (store .cse2 .cse1 v_ArrVal_6615) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6617))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6709))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6615))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6710) .cse4 v_ArrVal_6616) .cse5 v_ArrVal_6617) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6618) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 06:24:14,396 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:24:14,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346580044] [2023-11-29 06:24:14,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346580044] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:24:14,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946654875] [2023-11-29 06:24:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:24:14,396 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:24:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:24:14,397 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:24:14,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 06:24:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:24:50,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 06:24:50,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:24:50,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:24:50,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:24:50,664 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:24:50,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:24:50,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:24:50,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:24:50,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:24:50,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:24:51,403 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:24:51,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:24:51,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:24:51,496 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:24:51,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:24:51,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:24:51,557 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:24:51,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:24:51,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:24:51,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:24:51,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:24:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:24:51,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:24:51,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:24:51,673 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7181) |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 06:24:51,798 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7178) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7179))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7178) .cse2 v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:24:51,884 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7178) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7179))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7178) .cse3 v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:24:54,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7180 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7272))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7179))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7273) .cse0 v_ArrVal_7178) .cse1 v_ArrVal_7181) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7180) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7272 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7273 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7179 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7272))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7273) .cse6 v_ArrVal_7178) (select (select (store .cse7 .cse6 v_ArrVal_7179) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7181))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 06:24:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1946654875] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:24:54,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:24:54,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2023-11-29 06:24:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062221073] [2023-11-29 06:24:54,081 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:24:54,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:24:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:24:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:24:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=134, Unknown=10, NotChecked=310, Total=506 [2023-11-29 06:24:54,082 INFO L87 Difference]: Start difference. First operand 1272 states and 1427 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:25:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:25:13,837 INFO L93 Difference]: Finished difference Result 1813 states and 1967 transitions. [2023-11-29 06:25:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 06:25:13,837 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 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 107 [2023-11-29 06:25:13,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:25:13,840 INFO L225 Difference]: With dead ends: 1813 [2023-11-29 06:25:13,840 INFO L226 Difference]: Without dead ends: 1813 [2023-11-29 06:25:13,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 204 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=90, Invalid=282, Unknown=10, NotChecked=430, Total=812 [2023-11-29 06:25:13,840 INFO L413 NwaCegarLoop]: 580 mSDtfsCounter, 916 mSDsluCounter, 2194 mSDsCounter, 0 mSdLazyCounter, 5803 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 5813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 5803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:25:13,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 2774 Invalid, 5813 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [10 Valid, 5803 Invalid, 0 Unknown, 0 Unchecked, 19.3s Time] [2023-11-29 06:25:13,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-11-29 06:25:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1271. [2023-11-29 06:25:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 779 states have (on average 1.797175866495507) internal successors, (1400), 1259 states have internal predecessors, (1400), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:25:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1426 transitions. [2023-11-29 06:25:13,861 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1426 transitions. Word has length 107 [2023-11-29 06:25:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:25:13,861 INFO L495 AbstractCegarLoop]: Abstraction has 1271 states and 1426 transitions. [2023-11-29 06:25:13,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:25:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1426 transitions. [2023-11-29 06:25:13,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 06:25:13,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:25:13,862 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] [2023-11-29 06:25:13,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 06:25:14,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 06:25:14,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:25:14,262 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:25:14,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:25:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash 786526517, now seen corresponding path program 1 times [2023-11-29 06:25:14,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:25:14,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406508180] [2023-11-29 06:25:14,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:14,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:25:14,264 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:25:14,264 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:25:14,265 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:25:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:15,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 06:25:15,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:25:15,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:25:15,583 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:25:15,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 06:25:15,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:25:15,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 06:25:16,980 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:25:16,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:25:17,137 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:25:17,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 43 [2023-11-29 06:25:17,268 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:25:17,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:25:17,404 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:25:17,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:25:17,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 33 treesize of output 15 [2023-11-29 06:25:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:25:17,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:25:17,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_7713) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 06:25:17,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:25:17,620 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7712))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:17,641 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:25:17,664 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7711))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:17,688 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7711))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:18,196 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7759 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7711 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7759))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7711)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7712)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7713)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:18,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:25:18,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406508180] [2023-11-29 06:25:18,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406508180] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:25:18,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [117760373] [2023-11-29 06:25:18,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:25:18,202 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:25:18,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:25:18,203 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:25:18,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 06:25:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:25:27,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 06:25:27,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:25:27,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:25:27,772 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:25:27,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:25:27,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:25:28,835 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:25:28,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:25:29,060 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:25:29,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:25:29,210 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:25:29,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:25:29,358 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:25:29,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:25:29,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 06:25:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:25:29,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:25:33,542 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8198 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_8198) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:25:33,561 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8197))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:33,579 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:25:33,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8196))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:33,623 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8196))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:25:34,118 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 06:25:34,119 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 109 treesize of output 108 [2023-11-29 06:25:34,136 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8198 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8197 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8196 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8244 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8244))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8196)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8197)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8198)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 06:25:34,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [117760373] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:25:34,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:25:34,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 23 [2023-11-29 06:25:34,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6825719] [2023-11-29 06:25:34,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:25:34,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 06:25:34,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:25:34,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 06:25:34,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=575, Unknown=17, NotChecked=780, Total=1482 [2023-11-29 06:25:34,143 INFO L87 Difference]: Start difference. First operand 1271 states and 1426 transitions. Second operand has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 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 06:26:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:26:06,120 INFO L93 Difference]: Finished difference Result 2021 states and 2209 transitions. [2023-11-29 06:26:06,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 06:26:06,120 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 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 109 [2023-11-29 06:26:06,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:26:06,124 INFO L225 Difference]: With dead ends: 2021 [2023-11-29 06:26:06,124 INFO L226 Difference]: Without dead ends: 2021 [2023-11-29 06:26:06,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=192, Invalid=1033, Unknown=17, NotChecked=1014, Total=2256 [2023-11-29 06:26:06,125 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 2445 mSDsluCounter, 7887 mSDsCounter, 0 mSdLazyCounter, 10345 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2466 SdHoareTripleChecker+Valid, 8402 SdHoareTripleChecker+Invalid, 10405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 10345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:26:06,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2466 Valid, 8402 Invalid, 10405 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 10345 Invalid, 0 Unknown, 0 Unchecked, 31.0s Time] [2023-11-29 06:26:06,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2021 states. [2023-11-29 06:26:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2021 to 1270. [2023-11-29 06:26:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1270 states, 779 states have (on average 1.7958921694480103) internal successors, (1399), 1258 states have internal predecessors, (1399), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:26:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1425 transitions. [2023-11-29 06:26:06,140 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1425 transitions. Word has length 109 [2023-11-29 06:26:06,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:26:06,140 INFO L495 AbstractCegarLoop]: Abstraction has 1270 states and 1425 transitions. [2023-11-29 06:26:06,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 6.142857142857143) internal successors, (129), 23 states have internal predecessors, (129), 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 06:26:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1425 transitions. [2023-11-29 06:26:06,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 06:26:06,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:26:06,141 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] [2023-11-29 06:26:06,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:26:06,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 06:26:06,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:26:06,542 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:26:06,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:26:06,542 INFO L85 PathProgramCache]: Analyzing trace with hash 786526518, now seen corresponding path program 1 times [2023-11-29 06:26:06,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:26:06,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66377827] [2023-11-29 06:26:06,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:26:06,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:26:06,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:26:06,545 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:26:06,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:26:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:26:07,692 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 06:26:07,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:26:07,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:26:08,178 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:26:08,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:26:08,199 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 06:26:08,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:26:08,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:26:08,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:26:08,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:26:09,592 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:26:09,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:26:09,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:26:09,809 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:26:09,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:26:09,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:26:09,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:26:09,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:26:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:26:10,174 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:26:10,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:26:10,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:26:10,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:26:10,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 06:26:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:26:10,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:26:10,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8732) |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 06:26:10,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8732) |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 06:26:11,877 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8729) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8730))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8729) .cse3 v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:26:12,704 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8727))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8730))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8728) .cse0 v_ArrVal_8729) .cse1 v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8727))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8728) .cse6 v_ArrVal_8729) (select (select (store .cse7 .cse6 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8732))) |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 06:26:16,823 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8727))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8728) .cse2 v_ArrVal_8729) (select (select (store .cse3 .cse2 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8732))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8727))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8730))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8728) .cse5 v_ArrVal_8729) .cse6 v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 06:26:23,468 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8731 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8823))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8727))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8730))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8824) .cse0 v_ArrVal_8728) .cse1 v_ArrVal_8729) .cse2 v_ArrVal_8732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8731) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8727 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8824 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8823 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8823))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8727))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8824) .cse8 v_ArrVal_8728) .cse9 v_ArrVal_8729) (select (select (store .cse10 .cse9 v_ArrVal_8730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8732))))) |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 06:26:23,508 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:26:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66377827] [2023-11-29 06:26:23,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66377827] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:26:23,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1285712639] [2023-11-29 06:26:23,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:26:23,509 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:26:23,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:26:23,510 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:26:23,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 06:27:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:27:13,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 06:27:13,179 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:27:13,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:27:16,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 06:27:16,736 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:27:16,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:27:16,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:27:16,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 06:27:17,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 06:27:17,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:27:24,632 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:27:24,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:27:24,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:27:25,459 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:27:25,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:27:25,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:27:26,024 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:27:26,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:27:26,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:27:26,533 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:27:26,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 06:27:26,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 06:27:26,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 06:27:26,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 06:27:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:27:26,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:27:27,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_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 06:27:27,256 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 06:27:27,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9309) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9310))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9309) .cse2 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 06:27:27,994 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9309) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9310))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9309) .cse3 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 06:27:28,669 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9307))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9310))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9308) .cse0 v_ArrVal_9309) .cse1 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9307))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9308) .cse6 v_ArrVal_9309) (select (select (store .cse7 .cse6 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9312))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv20 32) .cse5) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 06:27:32,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9307))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9310))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9308) .cse1 v_ArrVal_9309) .cse2 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_9307))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_9308) .cse7 v_ArrVal_9309) (select (select (store .cse8 .cse7 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9312))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse6) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-11-29 06:27:41,741 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9311 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9403))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9307))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9310))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9404) .cse0 v_ArrVal_9308) .cse1 v_ArrVal_9309) .cse2 v_ArrVal_9312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9308 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9307 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9403))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9307))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9404) .cse8 v_ArrVal_9308) .cse9 v_ArrVal_9309) (select (select (store .cse10 .cse9 v_ArrVal_9310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9312))))) |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 06:27:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1285712639] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:27:41,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:27:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 06:27:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569797428] [2023-11-29 06:27:41,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:27:41,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 06:27:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:27:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 06:27:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=172, Unknown=25, NotChecked=494, Total=756 [2023-11-29 06:27:41,791 INFO L87 Difference]: Start difference. First operand 1270 states and 1425 transitions. Second operand has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:29:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:29:15,838 INFO L93 Difference]: Finished difference Result 1811 states and 1965 transitions. [2023-11-29 06:29:15,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:29:15,839 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 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 109 [2023-11-29 06:29:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:29:15,844 INFO L225 Difference]: With dead ends: 1811 [2023-11-29 06:29:15,845 INFO L226 Difference]: Without dead ends: 1811 [2023-11-29 06:29:15,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=111, Invalid=372, Unknown=31, NotChecked=676, Total=1190 [2023-11-29 06:29:15,846 INFO L413 NwaCegarLoop]: 579 mSDtfsCounter, 914 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 4198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 87.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 2176 SdHoareTripleChecker+Invalid, 4209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 4198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 89.8s IncrementalHoareTripleChecker+Time [2023-11-29 06:29:15,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 2176 Invalid, 4209 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 4198 Invalid, 0 Unknown, 0 Unchecked, 89.8s Time] [2023-11-29 06:29:15,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2023-11-29 06:29:15,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1269. [2023-11-29 06:29:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1269 states, 779 states have (on average 1.7946084724005136) internal successors, (1398), 1257 states have internal predecessors, (1398), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-29 06:29:15,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 1424 transitions. [2023-11-29 06:29:15,871 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 1424 transitions. Word has length 109 [2023-11-29 06:29:15,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:29:15,871 INFO L495 AbstractCegarLoop]: Abstraction has 1269 states and 1424 transitions. [2023-11-29 06:29:15,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.5) internal successors, (65), 12 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 06:29:15,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 1424 transitions. [2023-11-29 06:29:15,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 06:29:15,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:29:15,872 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] [2023-11-29 06:29:15,887 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 06:29:16,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 06:29:16,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 06:29:16,273 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 725 more)] === [2023-11-29 06:29:16,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:29:16,273 INFO L85 PathProgramCache]: Analyzing trace with hash -60258436, now seen corresponding path program 1 times [2023-11-29 06:29:16,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:29:16,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138079785] [2023-11-29 06:29:16,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:16,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:29:16,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:29:16,275 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:29:16,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 06:29:17,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:17,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 06:29:17,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:29:17,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:29:20,244 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 06:29:20,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 06:29:20,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 06:29:21,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 06:29:31,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:29:31,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 06:29:32,400 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:29:32,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 44 treesize of output 43 [2023-11-29 06:29:33,391 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:29:33,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:29:34,381 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:29:34,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:29:35,424 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 06:29:35,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 06:29:35,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 33 treesize of output 15 [2023-11-29 06:29:35,990 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 06:29:35,991 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 06:29:36,621 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:29:36,621 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:29:37,810 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_9862) |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 06:29:37,918 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9862) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 06:29:38,027 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9861))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:29:38,130 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:29:38,243 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9860))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 06:29:38,361 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:29:38,482 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9859))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:29:38,609 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9859))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:29:41,191 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9909 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9860 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9859 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9862 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9861 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ bv1 1)) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9909))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9859)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9860)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9861)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9862)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 06:29:41,220 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:29:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138079785] [2023-11-29 06:29:41,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138079785] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:29:41,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2025055806] [2023-11-29 06:29:41,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:29:41,221 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 06:29:41,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 06:29:41,222 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 06:29:41,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65f0a9bb-a957-44f8-9085-a68b3046c46f/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 06:29:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:29:53,048 INFO L262 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 06:29:53,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:29:53,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 06:29:57,313 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 06:29:57,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 06:29:57,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 06:30:05,727 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:30:05,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:30:07,456 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:30:07,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:30:08,522 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:30:08,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:30:09,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:30:09,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:30:10,743 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 06:30:10,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 06:30:10,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 06:30:11,268 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 06:30:11,269 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 21 treesize of output 20 [2023-11-29 06:30:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-11-29 06:30:11,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:30:16,544 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem38#1.base| v_ArrVal_10367) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))))) is different from false [2023-11-29 06:30:16,753 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10367) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1)))) is different from false [2023-11-29 06:30:16,920 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10366))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 06:30:17,068 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 06:30:17,224 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10365))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 06:30:17,382 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 06:30:17,539 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10364))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1))))) is different from false [2023-11-29 06:30:17,696 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc40#1.base_17| (_ BitVec 32)) (v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10368 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc40#1.base_17| v_ArrVal_10368) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10364))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 06:30:21,027 INFO L349 Elim1Store]: treesize reduction 207, result has 49.4 percent of original size [2023-11-29 06:30:21,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 603 treesize of output 609 [2023-11-29 06:30:21,133 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10366 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10367 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10414 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10414))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10364)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10365)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10366)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10367)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 06:30:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2025055806] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 06:30:21,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 06:30:21,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 25 [2023-11-29 06:30:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910978250] [2023-11-29 06:30:21,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 06:30:21,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 06:30:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:30:21,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 06:30:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=669, Unknown=19, NotChecked=1242, Total=2070 [2023-11-29 06:30:21,159 INFO L87 Difference]: Start difference. First operand 1269 states and 1424 transitions. Second operand has 26 states, 23 states have (on average 5.782608695652174) internal successors, (133), 25 states have internal predecessors, (133), 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)