./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/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_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/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_58bc91a5-5795-42d9-921e-9f9db92137a0/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 6d35be8b8e312d4eada0f7530ae9d43ecf1865be922a243e0781a735d175935c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:04:31,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:04:31,572 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:04:31,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:04:31,577 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:04:31,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:04:31,600 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:04:31,601 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:04:31,601 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:04:31,602 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:04:31,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:04:31,603 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:04:31,604 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:04:31,604 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:04:31,605 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:04:31,605 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:04:31,606 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:04:31,607 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:04:31,607 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:04:31,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:04:31,608 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:04:31,609 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:04:31,609 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:04:31,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:04:31,610 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:04:31,611 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:04:31,611 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:04:31,612 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:04:31,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:04:31,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:04:31,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:04:31,614 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:04:31,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:04:31,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:04:31,615 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:04:31,615 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:04:31,615 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:04:31,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:04:31,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:04:31,615 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:04:31,616 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:04:31,616 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_58bc91a5-5795-42d9-921e-9f9db92137a0/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_58bc91a5-5795-42d9-921e-9f9db92137a0/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 -> 6d35be8b8e312d4eada0f7530ae9d43ecf1865be922a243e0781a735d175935c [2023-11-29 02:04:31,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:04:31,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:04:31,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:04:31,846 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:04:31,847 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:04:31,848 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i [2023-11-29 02:04:34,663 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:04:34,916 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:04:34,917 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i [2023-11-29 02:04:34,934 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data/06c744d40/b9e507e4761b4d7dad8a83694ebfd2f3/FLAGe6cba4809 [2023-11-29 02:04:34,947 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data/06c744d40/b9e507e4761b4d7dad8a83694ebfd2f3 [2023-11-29 02:04:34,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:04:34,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:04:34,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:04:34,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:04:34,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:04:34,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:04:34" (1/1) ... [2023-11-29 02:04:34,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e71bf8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:34, skipping insertion in model container [2023-11-29 02:04:34,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:04:34" (1/1) ... [2023-11-29 02:04:35,026 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:04:35,437 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:04:35,449 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 02:04:35,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@19982437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:35, skipping insertion in model container [2023-11-29 02:04:35,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:04:35,450 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 02:04:35,451 INFO L158 Benchmark]: Toolchain (without parser) took 499.31ms. Allocated memory is still 163.6MB. Free memory was 121.1MB in the beginning and 99.7MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:04:35,451 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:04:35,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.81ms. Allocated memory is still 163.6MB. Free memory was 120.7MB in the beginning and 99.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 02:04:35,453 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 163.6MB. Free memory is still 107.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.81ms. Allocated memory is still 163.6MB. Free memory was 120.7MB in the beginning and 99.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 752]: 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_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/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_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/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_58bc91a5-5795-42d9-921e-9f9db92137a0/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 6d35be8b8e312d4eada0f7530ae9d43ecf1865be922a243e0781a735d175935c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:04:37,201 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:04:37,266 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:04:37,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:04:37,271 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:04:37,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:04:37,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:04:37,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:04:37,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:04:37,297 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:04:37,297 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:04:37,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:04:37,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:04:37,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:04:37,300 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:04:37,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:04:37,301 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:04:37,301 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:04:37,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:04:37,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:04:37,303 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:04:37,304 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:04:37,304 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:04:37,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:04:37,305 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:04:37,305 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:04:37,306 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:04:37,306 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:04:37,306 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:04:37,307 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:04:37,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:04:37,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:04:37,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:04:37,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:04:37,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:04:37,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:04:37,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:04:37,309 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:04:37,309 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:04:37,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:04:37,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:04:37,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:04:37,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:04:37,311 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:04:37,311 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_58bc91a5-5795-42d9-921e-9f9db92137a0/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_58bc91a5-5795-42d9-921e-9f9db92137a0/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 -> 6d35be8b8e312d4eada0f7530ae9d43ecf1865be922a243e0781a735d175935c [2023-11-29 02:04:37,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:04:37,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:04:37,623 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:04:37,624 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:04:37,624 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:04:37,626 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i [2023-11-29 02:04:40,431 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:04:40,771 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:04:40,772 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-2.i [2023-11-29 02:04:40,792 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data/172be1ead/030afb049921444b8349c6f62c4e7997/FLAGddf6b52bc [2023-11-29 02:04:40,810 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/data/172be1ead/030afb049921444b8349c6f62c4e7997 [2023-11-29 02:04:40,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:04:40,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:04:40,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:04:40,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:04:40,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:04:40,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:04:40" (1/1) ... [2023-11-29 02:04:40,825 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e301cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:40, skipping insertion in model container [2023-11-29 02:04:40,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:04:40" (1/1) ... [2023-11-29 02:04:40,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:04:41,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:04:41,525 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 02:04:41,541 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:04:41,638 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:04:41,644 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:04:41,740 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:04:41,785 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:04:41,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41 WrapperNode [2023-11-29 02:04:41,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:04:41,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:04:41,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:04:41,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:04:41,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:41,836 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:41,909 INFO L138 Inliner]: procedures = 180, calls = 401, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1340 [2023-11-29 02:04:41,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:04:41,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:04:41,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:04:41,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:04:41,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:41,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:41,941 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,092 INFO L175 MemorySlicer]: Split 367 memory accesses to 4 slices as follows [2, 5, 5, 355]. 97 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 92 writes are split as follows [0, 1, 1, 90]. [2023-11-29 02:04:42,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,093 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,150 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,170 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,192 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:04:42,193 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:04:42,194 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:04:42,194 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:04:42,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (1/1) ... [2023-11-29 02:04:42,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:04:42,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:04:42,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:04:42,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:04:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 02:04:42,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 02:04:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 02:04:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 02:04:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 02:04:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 02:04:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 02:04:42,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 02:04:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 02:04:42,267 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 02:04:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2023-11-29 02:04:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2023-11-29 02:04:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2023-11-29 02:04:42,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2023-11-29 02:04:42,267 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2023-11-29 02:04:42,268 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2023-11-29 02:04:42,268 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2023-11-29 02:04:42,268 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2023-11-29 02:04:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:04:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:04:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:04:42,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:04:42,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:04:42,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:04:42,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:04:42,271 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:04:42,524 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:04:42,526 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:04:42,531 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:04:42,586 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:04:42,610 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:04:42,633 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-11-29 02:04:48,162 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:04:48,326 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:04:48,326 INFO L309 CfgBuilder]: Removed 69 assume(true) statements. [2023-11-29 02:04:48,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:04:48 BoogieIcfgContainer [2023-11-29 02:04:48,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:04:48,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:04:48,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:04:48,331 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:04:48,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:04:40" (1/3) ... [2023-11-29 02:04:48,332 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f476ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:04:48, skipping insertion in model container [2023-11-29 02:04:48,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:04:41" (2/3) ... [2023-11-29 02:04:48,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f476ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:04:48, skipping insertion in model container [2023-11-29 02:04:48,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:04:48" (3/3) ... [2023-11-29 02:04:48,334 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-2.i [2023-11-29 02:04:48,350 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:04:48,350 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 753 error locations. [2023-11-29 02:04:48,407 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:04:48,413 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;@2146bed2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:04:48,413 INFO L358 AbstractCegarLoop]: Starting to check reachability of 753 error locations. [2023-11-29 02:04:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:04:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:04:48,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:04:48,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:04:48,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:04:48,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:04:48,431 INFO L85 PathProgramCache]: Analyzing trace with hash 71454806, now seen corresponding path program 1 times [2023-11-29 02:04:48,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:04:48,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834226752] [2023-11-29 02:04:48,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:04:48,441 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 02:04:48,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:04:48,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:48,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:04:48,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 02:04:48,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:04:48,713 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 02:04:48,714 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:04:48,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:04:48,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834226752] [2023-11-29 02:04:48,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834226752] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:04:48,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:04:48,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:04:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317889971] [2023-11-29 02:04:48,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:04:48,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:04:48,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:04:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:04:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:04:48,754 INFO L87 Difference]: Start difference. First operand has 1340 states, 574 states have (on average 2.559233449477352) internal successors, (1469), 1331 states have internal predecessors, (1469), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) 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 02:04:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:04:49,648 INFO L93 Difference]: Finished difference Result 1321 states and 1404 transitions. [2023-11-29 02:04:49,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:04:49,651 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 02:04:49,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:04:49,673 INFO L225 Difference]: With dead ends: 1321 [2023-11-29 02:04:49,673 INFO L226 Difference]: Without dead ends: 1320 [2023-11-29 02:04:49,675 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 02:04:49,678 INFO L413 NwaCegarLoop]: 1261 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:04:49,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1261 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:04:49,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2023-11-29 02:04:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2023-11-29 02:04:49,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 565 states have (on average 2.426548672566372) internal successors, (1371), 1311 states have internal predecessors, (1371), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:04:49,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1403 transitions. [2023-11-29 02:04:49,775 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1403 transitions. Word has length 4 [2023-11-29 02:04:49,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:04:49,775 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1403 transitions. [2023-11-29 02:04:49,775 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 02:04:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1403 transitions. [2023-11-29 02:04:49,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:04:49,776 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:04:49,776 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:04:49,784 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:49,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:49,977 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:04:49,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:04:49,978 INFO L85 PathProgramCache]: Analyzing trace with hash 71454868, now seen corresponding path program 1 times [2023-11-29 02:04:49,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:04:49,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014992269] [2023-11-29 02:04:49,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:04:49,979 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 02:04:49,979 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:04:49,980 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:49,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:04:50,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:04:50,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:04:50,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:04:50,157 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 02:04:50,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:04:50,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:04:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014992269] [2023-11-29 02:04:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014992269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:04:50,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:04:50,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:04:50,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161003441] [2023-11-29 02:04:50,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:04:50,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:04:50,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:04:50,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:04:50,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:04:50,161 INFO L87 Difference]: Start difference. First operand 1320 states and 1403 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 02:04:52,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:04:52,778 INFO L93 Difference]: Finished difference Result 1350 states and 1446 transitions. [2023-11-29 02:04:52,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:04:52,779 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 02:04:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:04:52,785 INFO L225 Difference]: With dead ends: 1350 [2023-11-29 02:04:52,785 INFO L226 Difference]: Without dead ends: 1350 [2023-11-29 02:04:52,785 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 02:04:52,786 INFO L413 NwaCegarLoop]: 657 mSDtfsCounter, 1042 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:04:52,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 838 Invalid, 953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 02:04:52,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2023-11-29 02:04:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1293. [2023-11-29 02:04:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1293 states, 631 states have (on average 2.223454833597464) internal successors, (1403), 1284 states have internal predecessors, (1403), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:04:52,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1435 transitions. [2023-11-29 02:04:52,815 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1435 transitions. Word has length 4 [2023-11-29 02:04:52,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:04:52,815 INFO L495 AbstractCegarLoop]: Abstraction has 1293 states and 1435 transitions. [2023-11-29 02:04:52,815 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 02:04:52,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1435 transitions. [2023-11-29 02:04:52,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-11-29 02:04:52,816 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:04:52,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-11-29 02:04:52,818 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:53,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:53,017 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:04:53,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:04:53,017 INFO L85 PathProgramCache]: Analyzing trace with hash 71454869, now seen corresponding path program 1 times [2023-11-29 02:04:53,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:04:53,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712620254] [2023-11-29 02:04:53,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:04:53,018 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 02:04:53,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:04:53,019 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:53,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:04:53,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:04:53,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:04:53,123 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 02:04:53,142 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 02:04:53,142 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:04:53,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:04:53,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712620254] [2023-11-29 02:04:53,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712620254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:04:53,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:04:53,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:04:53,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868952686] [2023-11-29 02:04:53,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:04:53,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:04:53,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:04:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:04:53,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:04:53,145 INFO L87 Difference]: Start difference. First operand 1293 states and 1435 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 02:04:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:04:57,100 INFO L93 Difference]: Finished difference Result 1565 states and 1727 transitions. [2023-11-29 02:04:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:04:57,101 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 02:04:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:04:57,108 INFO L225 Difference]: With dead ends: 1565 [2023-11-29 02:04:57,108 INFO L226 Difference]: Without dead ends: 1565 [2023-11-29 02:04:57,108 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 02:04:57,109 INFO L413 NwaCegarLoop]: 985 mSDtfsCounter, 456 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:04:57,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 1462 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 02:04:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2023-11-29 02:04:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1416. [2023-11-29 02:04:57,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 764 states have (on average 2.193717277486911) internal successors, (1676), 1407 states have internal predecessors, (1676), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:04:57,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1708 transitions. [2023-11-29 02:04:57,151 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1708 transitions. Word has length 4 [2023-11-29 02:04:57,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:04:57,151 INFO L495 AbstractCegarLoop]: Abstraction has 1416 states and 1708 transitions. [2023-11-29 02:04:57,151 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 02:04:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1708 transitions. [2023-11-29 02:04:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-29 02:04:57,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:04:57,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:04:57,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:57,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:57,354 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:04:57,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:04:57,354 INFO L85 PathProgramCache]: Analyzing trace with hash -2078175095, now seen corresponding path program 1 times [2023-11-29 02:04:57,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:04:57,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167743398] [2023-11-29 02:04:57,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:04:57,355 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 02:04:57,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:04:57,356 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:57,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:04:57,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:04:57,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:04:57,467 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 02:04:57,467 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:04:57,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:04:57,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167743398] [2023-11-29 02:04:57,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167743398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:04:57,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:04:57,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:04:57,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178669085] [2023-11-29 02:04:57,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:04:57,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:04:57,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:04:57,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:04:57,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:04:57,470 INFO L87 Difference]: Start difference. First operand 1416 states and 1708 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 02:04:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:04:59,199 INFO L93 Difference]: Finished difference Result 2605 states and 3158 transitions. [2023-11-29 02:04:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:04:59,201 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 02:04:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:04:59,214 INFO L225 Difference]: With dead ends: 2605 [2023-11-29 02:04:59,215 INFO L226 Difference]: Without dead ends: 2605 [2023-11-29 02:04:59,215 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 02:04:59,216 INFO L413 NwaCegarLoop]: 1556 mSDtfsCounter, 1029 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:04:59,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 2710 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 02:04:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2023-11-29 02:04:59,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 1417. [2023-11-29 02:04:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 765 states have (on average 2.1921568627450982) internal successors, (1677), 1408 states have internal predecessors, (1677), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:04:59,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1709 transitions. [2023-11-29 02:04:59,263 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1709 transitions. Word has length 5 [2023-11-29 02:04:59,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:04:59,263 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1709 transitions. [2023-11-29 02:04:59,263 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 02:04:59,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1709 transitions. [2023-11-29 02:04:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-29 02:04:59,264 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:04:59,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:04:59,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:04:59,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:59,467 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:04:59,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:04:59,467 INFO L85 PathProgramCache]: Analyzing trace with hash 9598878, now seen corresponding path program 1 times [2023-11-29 02:04:59,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:04:59,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254268247] [2023-11-29 02:04:59,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:04:59,468 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 02:04:59,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:04:59,469 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:59,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:04:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:04:59,601 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:04:59,604 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:04:59,611 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 02:04:59,611 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:04:59,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:04:59,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254268247] [2023-11-29 02:04:59,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254268247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:04:59,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:04:59,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:04:59,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31459574] [2023-11-29 02:04:59,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:04:59,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:04:59,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:04:59,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:04:59,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:04:59,613 INFO L87 Difference]: Start difference. First operand 1417 states and 1709 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 02:05:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:00,629 INFO L93 Difference]: Finished difference Result 1378 states and 1669 transitions. [2023-11-29 02:05:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:05:00,631 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 02:05:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:00,636 INFO L225 Difference]: With dead ends: 1378 [2023-11-29 02:05:00,636 INFO L226 Difference]: Without dead ends: 1378 [2023-11-29 02:05:00,636 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 02:05:00,637 INFO L413 NwaCegarLoop]: 1109 mSDtfsCounter, 70 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:00,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2169 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:05:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2023-11-29 02:05:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2023-11-29 02:05:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 750 states have (on average 2.1826666666666665) internal successors, (1637), 1369 states have internal predecessors, (1637), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:00,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1669 transitions. [2023-11-29 02:05:00,661 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1669 transitions. Word has length 10 [2023-11-29 02:05:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:00,661 INFO L495 AbstractCegarLoop]: Abstraction has 1378 states and 1669 transitions. [2023-11-29 02:05:00,661 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 02:05:00,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1669 transitions. [2023-11-29 02:05:00,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:05:00,661 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:00,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:05:00,664 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:00,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:00,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:00,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:00,862 INFO L85 PathProgramCache]: Analyzing trace with hash 634583864, now seen corresponding path program 1 times [2023-11-29 02:05:00,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:00,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7004826] [2023-11-29 02:05:00,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:00,863 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 02:05:00,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:00,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:00,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:01,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:05:01,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:01,025 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 02:05:01,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:01,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:01,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7004826] [2023-11-29 02:05:01,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7004826] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:01,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:01,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309066748] [2023-11-29 02:05:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:01,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:01,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:01,027 INFO L87 Difference]: Start difference. First operand 1378 states and 1669 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 02:05:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:02,381 INFO L93 Difference]: Finished difference Result 1364 states and 1648 transitions. [2023-11-29 02:05:02,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:02,383 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 02:05:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:02,388 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 02:05:02,388 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 02:05:02,389 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 02:05:02,389 INFO L413 NwaCegarLoop]: 1078 mSDtfsCounter, 58 mSDsluCounter, 2132 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3210 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:02,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3210 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:05:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 02:05:02,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1363. [2023-11-29 02:05:02,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 749 states have (on average 2.156208277703605) internal successors, (1615), 1354 states have internal predecessors, (1615), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:02,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1647 transitions. [2023-11-29 02:05:02,412 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1647 transitions. Word has length 12 [2023-11-29 02:05:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:02,412 INFO L495 AbstractCegarLoop]: Abstraction has 1363 states and 1647 transitions. [2023-11-29 02:05:02,413 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 02:05:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1647 transitions. [2023-11-29 02:05:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:05:02,413 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:02,414 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 02:05:02,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:02,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:02,616 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:02,616 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1624158822, now seen corresponding path program 1 times [2023-11-29 02:05:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747454966] [2023-11-29 02:05:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:02,617 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 02:05:02,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:02,618 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:02,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:02,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:05:02,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:02,784 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 02:05:02,844 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 02:05:02,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:02,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:02,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747454966] [2023-11-29 02:05:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747454966] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:02,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:05:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383890001] [2023-11-29 02:05:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:02,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:02,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:02,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:02,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:02,847 INFO L87 Difference]: Start difference. First operand 1363 states and 1647 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 02:05:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:05,906 INFO L93 Difference]: Finished difference Result 1416 states and 1654 transitions. [2023-11-29 02:05:05,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:05,907 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 02:05:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:05,914 INFO L225 Difference]: With dead ends: 1416 [2023-11-29 02:05:05,914 INFO L226 Difference]: Without dead ends: 1416 [2023-11-29 02:05:05,914 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 02:05:05,915 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 977 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:05,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 1267 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-11-29 02:05:05,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2023-11-29 02:05:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1359. [2023-11-29 02:05:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 749 states have (on average 2.15086782376502) internal successors, (1611), 1350 states have internal predecessors, (1611), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1643 transitions. [2023-11-29 02:05:05,935 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1643 transitions. Word has length 26 [2023-11-29 02:05:05,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:05,935 INFO L495 AbstractCegarLoop]: Abstraction has 1359 states and 1643 transitions. [2023-11-29 02:05:05,936 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 02:05:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1643 transitions. [2023-11-29 02:05:05,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:05:05,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:05,936 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 02:05:05,939 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:06,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:06,137 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:06,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:06,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1624158823, now seen corresponding path program 1 times [2023-11-29 02:05:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245713923] [2023-11-29 02:05:06,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:06,138 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 02:05:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:06,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:06,140 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:06,281 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:05:06,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:06,290 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 02:05:06,470 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 02:05:06,471 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:06,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:06,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245713923] [2023-11-29 02:05:06,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245713923] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:06,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:06,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:05:06,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736353755] [2023-11-29 02:05:06,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:06,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:06,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:06,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:06,473 INFO L87 Difference]: Start difference. First operand 1359 states and 1643 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 02:05:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:11,038 INFO L93 Difference]: Finished difference Result 1504 states and 1658 transitions. [2023-11-29 02:05:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:11,038 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 02:05:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:11,044 INFO L225 Difference]: With dead ends: 1504 [2023-11-29 02:05:11,044 INFO L226 Difference]: Without dead ends: 1504 [2023-11-29 02:05:11,045 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 02:05:11,045 INFO L413 NwaCegarLoop]: 949 mSDtfsCounter, 393 mSDsluCounter, 989 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:11,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1938 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1616 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 02:05:11,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2023-11-29 02:05:11,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1355. [2023-11-29 02:05:11,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1355 states, 749 states have (on average 2.145527369826435) internal successors, (1607), 1346 states have internal predecessors, (1607), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1639 transitions. [2023-11-29 02:05:11,074 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1639 transitions. Word has length 26 [2023-11-29 02:05:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:11,074 INFO L495 AbstractCegarLoop]: Abstraction has 1355 states and 1639 transitions. [2023-11-29 02:05:11,074 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 02:05:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1639 transitions. [2023-11-29 02:05:11,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-11-29 02:05:11,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:11,076 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 02:05:11,079 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:11,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:11,277 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:11,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:11,277 INFO L85 PathProgramCache]: Analyzing trace with hash 869234144, now seen corresponding path program 1 times [2023-11-29 02:05:11,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:11,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313858643] [2023-11-29 02:05:11,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:11,278 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 02:05:11,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:11,278 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:11,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:11,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:05:11,469 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:11,509 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 02:05:11,509 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:11,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:11,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313858643] [2023-11-29 02:05:11,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313858643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:11,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:11,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:11,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511139368] [2023-11-29 02:05:11,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:11,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:11,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:11,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:11,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:11,511 INFO L87 Difference]: Start difference. First operand 1355 states and 1639 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 02:05:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:12,850 INFO L93 Difference]: Finished difference Result 1349 states and 1629 transitions. [2023-11-29 02:05:12,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:12,852 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 02:05:12,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:12,857 INFO L225 Difference]: With dead ends: 1349 [2023-11-29 02:05:12,857 INFO L226 Difference]: Without dead ends: 1349 [2023-11-29 02:05:12,857 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 02:05:12,858 INFO L413 NwaCegarLoop]: 1072 mSDtfsCounter, 23 mSDsluCounter, 2124 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3196 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:12,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3196 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:05:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-11-29 02:05:12,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1349. [2023-11-29 02:05:12,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 743 states have (on average 2.149394347240915) internal successors, (1597), 1340 states have internal predecessors, (1597), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:12,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1629 transitions. [2023-11-29 02:05:12,891 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1629 transitions. Word has length 42 [2023-11-29 02:05:12,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:12,891 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1629 transitions. [2023-11-29 02:05:12,892 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 02:05:12,892 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1629 transitions. [2023-11-29 02:05:12,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-11-29 02:05:12,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:12,893 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 02:05:12,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:13,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:13,094 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:13,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:13,095 INFO L85 PathProgramCache]: Analyzing trace with hash -132264064, now seen corresponding path program 1 times [2023-11-29 02:05:13,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:13,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44719177] [2023-11-29 02:05:13,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:13,096 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 02:05:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:13,097 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:13,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:13,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:05:13,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:13,580 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 02:05:13,580 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:13,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44719177] [2023-11-29 02:05:13,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44719177] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:13,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:05:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440441257] [2023-11-29 02:05:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:13,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:05:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:13,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:05:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:05:13,582 INFO L87 Difference]: Start difference. First operand 1349 states and 1629 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 02:05:14,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:14,768 INFO L93 Difference]: Finished difference Result 1572 states and 1861 transitions. [2023-11-29 02:05:14,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:05:14,770 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 02:05:14,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:14,777 INFO L225 Difference]: With dead ends: 1572 [2023-11-29 02:05:14,777 INFO L226 Difference]: Without dead ends: 1572 [2023-11-29 02:05:14,777 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 02:05:14,778 INFO L413 NwaCegarLoop]: 1139 mSDtfsCounter, 246 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:14,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2112 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:05:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2023-11-29 02:05:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1392. [2023-11-29 02:05:14,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 786 states have (on average 2.0865139949109417) internal successors, (1640), 1383 states have internal predecessors, (1640), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1672 transitions. [2023-11-29 02:05:14,797 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1672 transitions. Word has length 46 [2023-11-29 02:05:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:14,797 INFO L495 AbstractCegarLoop]: Abstraction has 1392 states and 1672 transitions. [2023-11-29 02:05:14,798 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 02:05:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1672 transitions. [2023-11-29 02:05:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 02:05:14,799 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:14,799 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 02:05:14,804 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 02:05:15,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:15,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:15,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:15,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1901175151, now seen corresponding path program 1 times [2023-11-29 02:05:15,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:15,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943089630] [2023-11-29 02:05:15,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:15,005 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 02:05:15,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:15,006 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:15,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:15,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 02:05:15,307 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:15,316 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 02:05:15,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:05:15,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:05:15,743 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 02:05:15,760 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:05:15,761 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 02:05:15,781 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 02:05:15,781 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:15,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:15,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943089630] [2023-11-29 02:05:15,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943089630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:15,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:15,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:05:15,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775589171] [2023-11-29 02:05:15,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:15,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:15,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:15,783 INFO L87 Difference]: Start difference. First operand 1392 states and 1672 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 02:05:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:19,049 INFO L93 Difference]: Finished difference Result 1364 states and 1598 transitions. [2023-11-29 02:05:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:19,049 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 02:05:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:19,054 INFO L225 Difference]: With dead ends: 1364 [2023-11-29 02:05:19,054 INFO L226 Difference]: Without dead ends: 1364 [2023-11-29 02:05:19,054 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 02:05:19,055 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 943 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:19,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 702 Invalid, 1197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 02:05:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2023-11-29 02:05:19,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1175. [2023-11-29 02:05:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1304 transitions. [2023-11-29 02:05:19,073 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1304 transitions. Word has length 49 [2023-11-29 02:05:19,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:19,073 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1304 transitions. [2023-11-29 02:05:19,074 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 02:05:19,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1304 transitions. [2023-11-29 02:05:19,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 02:05:19,075 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:19,075 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 02:05:19,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:19,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:19,275 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:19,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 798272896, now seen corresponding path program 1 times [2023-11-29 02:05:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:19,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814934022] [2023-11-29 02:05:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:19,277 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 02:05:19,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:19,277 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:19,278 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:19,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:05:19,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:19,504 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 02:05:19,520 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 02:05:19,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 23 treesize of output 11 [2023-11-29 02:05:19,549 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 02:05:19,549 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:19,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814934022] [2023-11-29 02:05:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814934022] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:19,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:19,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:19,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817887095] [2023-11-29 02:05:19,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:19,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:05:19,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:19,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:05:19,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:05:19,551 INFO L87 Difference]: Start difference. First operand 1175 states and 1304 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 02:05:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:23,239 INFO L93 Difference]: Finished difference Result 1174 states and 1303 transitions. [2023-11-29 02:05:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:05:23,240 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 02:05:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:23,245 INFO L225 Difference]: With dead ends: 1174 [2023-11-29 02:05:23,245 INFO L226 Difference]: Without dead ends: 1174 [2023-11-29 02:05:23,245 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 02:05:23,246 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 3 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1975 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2556 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:23,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2556 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1975 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 02:05:23,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-11-29 02:05:23,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1174. [2023-11-29 02:05:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 653 states have (on average 1.9464012251148546) internal successors, (1271), 1165 states have internal predecessors, (1271), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:23,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1303 transitions. [2023-11-29 02:05:23,260 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1303 transitions. Word has length 53 [2023-11-29 02:05:23,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:23,260 INFO L495 AbstractCegarLoop]: Abstraction has 1174 states and 1303 transitions. [2023-11-29 02:05:23,260 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 02:05:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1303 transitions. [2023-11-29 02:05:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-29 02:05:23,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:23,261 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 02:05:23,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:23,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:23,462 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:23,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:23,462 INFO L85 PathProgramCache]: Analyzing trace with hash 798272897, now seen corresponding path program 1 times [2023-11-29 02:05:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:23,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460466194] [2023-11-29 02:05:23,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:23,463 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 02:05:23,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:23,464 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:23,464 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:23,699 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 02:05:23,702 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:23,710 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 02:05:23,726 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 02:05:23,734 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 02:05:23,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 02:05:23,785 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 02:05:23,785 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:23,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:23,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460466194] [2023-11-29 02:05:23,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460466194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:23,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:23,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:23,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164231891] [2023-11-29 02:05:23,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:23,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:05:23,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:23,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:05:23,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:05:23,787 INFO L87 Difference]: Start difference. First operand 1174 states and 1303 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 02:05:28,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:28,407 INFO L93 Difference]: Finished difference Result 1173 states and 1302 transitions. [2023-11-29 02:05:28,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:05:28,408 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 02:05:28,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:28,413 INFO L225 Difference]: With dead ends: 1173 [2023-11-29 02:05:28,413 INFO L226 Difference]: Without dead ends: 1173 [2023-11-29 02:05:28,413 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 02:05:28,413 INFO L413 NwaCegarLoop]: 1000 mSDtfsCounter, 1 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2593 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:28,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2593 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 02:05:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2023-11-29 02:05:28,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1173. [2023-11-29 02:05:28,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 652 states have (on average 1.9478527607361964) internal successors, (1270), 1164 states have internal predecessors, (1270), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-29 02:05:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1302 transitions. [2023-11-29 02:05:28,427 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1302 transitions. Word has length 53 [2023-11-29 02:05:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:28,428 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1302 transitions. [2023-11-29 02:05:28,428 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 02:05:28,428 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1302 transitions. [2023-11-29 02:05:28,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 02:05:28,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:28,429 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 02:05:28,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:28,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:28,629 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:28,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 846185892, now seen corresponding path program 1 times [2023-11-29 02:05:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837356365] [2023-11-29 02:05:28,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:28,631 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 02:05:28,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:28,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:28,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:28,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:05:28,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:28,901 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 02:05:28,901 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:05:28,901 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:28,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837356365] [2023-11-29 02:05:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837356365] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:05:28,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:05:28,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:05:28,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467271083] [2023-11-29 02:05:28,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:05:28,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:05:28,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:28,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:05:28,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:05:28,903 INFO L87 Difference]: Start difference. First operand 1173 states and 1302 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 02:05:30,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:30,105 INFO L93 Difference]: Finished difference Result 1175 states and 1306 transitions. [2023-11-29 02:05:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:05:30,105 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 02:05:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:30,110 INFO L225 Difference]: With dead ends: 1175 [2023-11-29 02:05:30,110 INFO L226 Difference]: Without dead ends: 1175 [2023-11-29 02:05:30,111 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 02:05:30,111 INFO L413 NwaCegarLoop]: 999 mSDtfsCounter, 1 mSDsluCounter, 1992 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2991 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:30,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2991 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 02:05:30,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2023-11-29 02:05:30,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1175. [2023-11-29 02:05:30,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 653 states have (on average 1.9479326186830015) internal successors, (1272), 1166 states have internal predecessors, (1272), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:05:30,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1306 transitions. [2023-11-29 02:05:30,127 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1306 transitions. Word has length 59 [2023-11-29 02:05:30,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:30,127 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1306 transitions. [2023-11-29 02:05:30,127 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 02:05:30,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1306 transitions. [2023-11-29 02:05:30,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:05:30,128 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:30,128 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 02:05:30,133 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:30,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:30,328 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:30,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:30,329 INFO L85 PathProgramCache]: Analyzing trace with hash 960552479, now seen corresponding path program 1 times [2023-11-29 02:05:30,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:30,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338347486] [2023-11-29 02:05:30,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:05:30,329 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 02:05:30,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:30,330 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:30,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:05:30,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:05:30,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:30,584 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 02:05:30,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:05:30,643 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 02:05:30,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:30,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338347486] [2023-11-29 02:05:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338347486] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:05:30,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:05:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 02:05:30,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108575920] [2023-11-29 02:05:30,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:05:30,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:05:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:05:30,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:05:30,646 INFO L87 Difference]: Start difference. First operand 1175 states and 1306 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 02:05:32,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:32,083 INFO L93 Difference]: Finished difference Result 1184 states and 1321 transitions. [2023-11-29 02:05:32,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:05:32,084 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 02:05:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:32,089 INFO L225 Difference]: With dead ends: 1184 [2023-11-29 02:05:32,089 INFO L226 Difference]: Without dead ends: 1184 [2023-11-29 02:05:32,089 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 02:05:32,089 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 7 mSDsluCounter, 1990 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:32,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2987 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 02:05:32,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2023-11-29 02:05:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1183. [2023-11-29 02:05:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 660 states have (on average 1.946969696969697) internal successors, (1285), 1173 states have internal predecessors, (1285), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:05:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1319 transitions. [2023-11-29 02:05:32,106 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1319 transitions. Word has length 60 [2023-11-29 02:05:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:32,106 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1319 transitions. [2023-11-29 02:05:32,106 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 02:05:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1319 transitions. [2023-11-29 02:05:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-29 02:05:32,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:32,107 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 02:05:32,111 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:32,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:32,307 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:32,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -365982620, now seen corresponding path program 2 times [2023-11-29 02:05:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073115041] [2023-11-29 02:05:32,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:05:32,308 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 02:05:32,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:32,309 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:32,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:32,688 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:05:32,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:05:32,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 02:05:32,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:32,750 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 02:05:32,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:05:32,909 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 02:05:32,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:32,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073115041] [2023-11-29 02:05:32,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073115041] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:05:32,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:05:32,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2023-11-29 02:05:32,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429572468] [2023-11-29 02:05:32,910 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:05:32,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:05:32,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:32,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:05:32,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:05:32,911 INFO L87 Difference]: Start difference. First operand 1183 states and 1319 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 02:05:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:36,063 INFO L93 Difference]: Finished difference Result 1198 states and 1345 transitions. [2023-11-29 02:05:36,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:05:36,063 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 02:05:36,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:36,068 INFO L225 Difference]: With dead ends: 1198 [2023-11-29 02:05:36,068 INFO L226 Difference]: Without dead ends: 1196 [2023-11-29 02:05:36,068 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 02:05:36,069 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 12 mSDsluCounter, 4975 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5972 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:36,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5972 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:05:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2023-11-29 02:05:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1192. [2023-11-29 02:05:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 669 states have (on average 1.9387144992526157) internal successors, (1297), 1182 states have internal predecessors, (1297), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:05:36,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1331 transitions. [2023-11-29 02:05:36,091 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1331 transitions. Word has length 63 [2023-11-29 02:05:36,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:36,091 INFO L495 AbstractCegarLoop]: Abstraction has 1192 states and 1331 transitions. [2023-11-29 02:05:36,091 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 02:05:36,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1331 transitions. [2023-11-29 02:05:36,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 02:05:36,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:36,092 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 02:05:36,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 02:05:36,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:36,293 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:36,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:36,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1048289924, now seen corresponding path program 3 times [2023-11-29 02:05:36,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:36,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557417463] [2023-11-29 02:05:36,294 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:05:36,294 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 02:05:36,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:36,295 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:36,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:36,857 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 02:05:36,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:05:36,871 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 02:05:36,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:36,994 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 02:05:36,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:05:37,626 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 02:05:37,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:37,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557417463] [2023-11-29 02:05:37,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557417463] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:05:37,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:05:37,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-11-29 02:05:37,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725050825] [2023-11-29 02:05:37,627 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:05:37,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 02:05:37,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:37,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 02:05:37,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:05:37,628 INFO L87 Difference]: Start difference. First operand 1192 states and 1331 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 02:05:45,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:05:45,554 INFO L93 Difference]: Finished difference Result 1222 states and 1395 transitions. [2023-11-29 02:05:45,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-29 02:05:45,555 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 02:05:45,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:05:45,561 INFO L225 Difference]: With dead ends: 1222 [2023-11-29 02:05:45,562 INFO L226 Difference]: Without dead ends: 1219 [2023-11-29 02:05:45,563 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 02:05:45,563 INFO L413 NwaCegarLoop]: 995 mSDtfsCounter, 24 mSDsluCounter, 13888 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 14883 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:05:45,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 14883 Invalid, 2978 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [21 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-11-29 02:05:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-29 02:05:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1210. [2023-11-29 02:05:45,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 687 states have (on average 1.9213973799126638) internal successors, (1320), 1200 states have internal predecessors, (1320), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:05:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1354 transitions. [2023-11-29 02:05:45,581 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1354 transitions. Word has length 69 [2023-11-29 02:05:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:05:45,582 INFO L495 AbstractCegarLoop]: Abstraction has 1210 states and 1354 transitions. [2023-11-29 02:05:45,582 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 02:05:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1354 transitions. [2023-11-29 02:05:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 02:05:45,582 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:05:45,582 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 02:05:45,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 02:05:45,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:45,783 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:05:45,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:05:45,784 INFO L85 PathProgramCache]: Analyzing trace with hash -454916412, now seen corresponding path program 4 times [2023-11-29 02:05:45,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:05:45,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929392957] [2023-11-29 02:05:45,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:05:45,785 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 02:05:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:05:45,786 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:45,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:05:46,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:05:46,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:05:46,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:05:46,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:05:46,494 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 02:05:46,494 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:05:48,036 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 02:05:48,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:05:48,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929392957] [2023-11-29 02:05:48,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929392957] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:05:48,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:05:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2023-11-29 02:05:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771960021] [2023-11-29 02:05:48,038 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:05:48,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-29 02:05:48,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:05:48,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-29 02:05:48,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2023-11-29 02:05:48,040 INFO L87 Difference]: Start difference. First operand 1210 states and 1354 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 02:06:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:06:04,198 INFO L93 Difference]: Finished difference Result 1267 states and 1464 transitions. [2023-11-29 02:06:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-29 02:06:04,198 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 02:06:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:06:04,202 INFO L225 Difference]: With dead ends: 1267 [2023-11-29 02:06:04,202 INFO L226 Difference]: Without dead ends: 1265 [2023-11-29 02:06:04,206 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 02:06:04,206 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 47 mSDsluCounter, 22885 mSDsCounter, 0 mSdLazyCounter, 6068 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 23882 SdHoareTripleChecker+Invalid, 6133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 6068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:06:04,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 23882 Invalid, 6133 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 6068 Invalid, 0 Unknown, 0 Unchecked, 11.6s Time] [2023-11-29 02:06:04,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1265 states. [2023-11-29 02:06:04,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1265 to 1244. [2023-11-29 02:06:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 721 states have (on average 1.8945908460471568) internal successors, (1366), 1234 states have internal predecessors, (1366), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:06:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1400 transitions. [2023-11-29 02:06:04,232 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 1400 transitions. Word has length 81 [2023-11-29 02:06:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:06:04,232 INFO L495 AbstractCegarLoop]: Abstraction has 1244 states and 1400 transitions. [2023-11-29 02:06:04,232 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 02:06:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 1400 transitions. [2023-11-29 02:06:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 02:06:04,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:06:04,234 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 02:06:04,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:06:04,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:06:04,434 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:06:04,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:06:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 9547748, now seen corresponding path program 5 times [2023-11-29 02:06:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:06:04,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615248384] [2023-11-29 02:06:04,435 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:06:04,435 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 02:06:04,435 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:06:04,436 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:06:04,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:06:05,796 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:06:05,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:06:05,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 58 conjunts are in the unsatisfiable core [2023-11-29 02:06:05,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:06:05,852 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 02:06:05,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 02:06:06,212 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 02:06:06,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 02:06:06,290 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 02:06:06,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 42 treesize of output 24 [2023-11-29 02:06:08,798 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:06:08,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 02:06:08,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2023-11-29 02:06:08,934 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 02:06:08,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:06:09,304 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1648 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1648) |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 02:06:09,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:06:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [615248384] [2023-11-29 02:06:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [615248384] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:06:09,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1733539362] [2023-11-29 02:06:09,306 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:06:09,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:06:09,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:06:09,307 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:06:09,308 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-11-29 02:07:07,340 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 02:07:07,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:07:07,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-29 02:07:07,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:07:07,618 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:07:07,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:07:08,022 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:07:08,022 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 20 treesize of output 22 [2023-11-29 02:07:08,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:07:08,679 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:07:08,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:07:08,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 35 treesize of output 19 [2023-11-29 02:07:08,797 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 02:07:08,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:07:09,210 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-11-29 02:07:09,210 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 02:07:09,217 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2092 (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_2092) |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 02:07:09,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1733539362] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:07:09,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:07:09,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-29 02:07:09,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136585082] [2023-11-29 02:07:09,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:07:09,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:07:09,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:07:09,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:07:09,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=410, Unknown=2, NotChecked=82, Total=552 [2023-11-29 02:07:09,221 INFO L87 Difference]: Start difference. First operand 1244 states and 1400 transitions. Second operand has 20 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 18 states have internal predecessors, (118), 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 02:07:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:07:29,918 INFO L93 Difference]: Finished difference Result 2416 states and 2626 transitions. [2023-11-29 02:07:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 02:07:29,919 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 18 states have internal predecessors, (118), 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 02:07:29,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:07:29,925 INFO L225 Difference]: With dead ends: 2416 [2023-11-29 02:07:29,925 INFO L226 Difference]: Without dead ends: 2412 [2023-11-29 02:07:29,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=271, Invalid=1627, Unknown=2, NotChecked=170, Total=2070 [2023-11-29 02:07:29,926 INFO L413 NwaCegarLoop]: 503 mSDtfsCounter, 5263 mSDsluCounter, 7594 mSDsCounter, 0 mSdLazyCounter, 10885 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5263 SdHoareTripleChecker+Valid, 8097 SdHoareTripleChecker+Invalid, 11128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 10885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:07:29,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5263 Valid, 8097 Invalid, 11128 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [243 Valid, 10885 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2023-11-29 02:07:29,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2023-11-29 02:07:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 1290. [2023-11-29 02:07:29,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 767 states have (on average 1.8409387222946545) internal successors, (1412), 1279 states have internal predecessors, (1412), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:07:29,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1446 transitions. [2023-11-29 02:07:29,958 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1446 transitions. Word has length 103 [2023-11-29 02:07:29,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:07:29,958 INFO L495 AbstractCegarLoop]: Abstraction has 1290 states and 1446 transitions. [2023-11-29 02:07:29,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.9411764705882355) internal successors, (118), 18 states have internal predecessors, (118), 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 02:07:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1446 transitions. [2023-11-29 02:07:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 02:07:29,960 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:07:29,960 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 02:07:30,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-11-29 02:07:30,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:07:30,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:07:30,363 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:07:30,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:07:30,364 INFO L85 PathProgramCache]: Analyzing trace with hash 9547749, now seen corresponding path program 1 times [2023-11-29 02:07:30,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:07:30,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845373323] [2023-11-29 02:07:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:30,365 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 02:07:30,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:07:30,366 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:07:30,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:07:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:07:31,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 109 conjunts are in the unsatisfiable core [2023-11-29 02:07:31,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:07:31,059 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 02:07:31,257 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 02:07:31,272 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:07:31,273 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 02:07:31,296 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 02:07:31,309 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 02:07:31,405 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 02:07:31,408 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 02:07:31,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:07:31,970 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 02:07:31,979 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 02:07:32,013 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 02:07:32,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 02:07:32,037 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 02:07:32,037 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:07:33,337 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2628 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2629 (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_2629) |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_2628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_2629 (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_2629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-11-29 02:07:33,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:07:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845373323] [2023-11-29 02:07:33,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845373323] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:07:33,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [460259907] [2023-11-29 02:07:33,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:07:33,344 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:07:33,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:07:33,345 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:07:33,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-11-29 02:09:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:13,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 110 conjunts are in the unsatisfiable core [2023-11-29 02:09:13,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:09:13,722 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 02:09:13,933 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:09:13,934 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 02:09:13,945 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 02:09:13,958 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 02:09:13,967 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 02:09:14,024 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 02:09:14,028 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 02:09:14,628 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:09:14,628 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 02:09:14,638 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 02:09:14,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:09:14,683 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 02:09:14,687 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 02:09:14,688 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:09:16,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3165 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3165) |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~mem33#1.base| v_ArrVal_3166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3165 (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_3165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd (_ bv20 32) .cse1)))))) is different from false [2023-11-29 02:09:16,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [460259907] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:09:16,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:09:16,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-11-29 02:09:16,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812761429] [2023-11-29 02:09:16,039 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:09:16,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:09:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:09:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:09:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=88, Unknown=2, NotChecked=38, Total=156 [2023-11-29 02:09:16,040 INFO L87 Difference]: Start difference. First operand 1290 states and 1446 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 02:09:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:09:28,759 INFO L93 Difference]: Finished difference Result 1633 states and 1757 transitions. [2023-11-29 02:09:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:09:28,760 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 02:09:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:09:28,764 INFO L225 Difference]: With dead ends: 1633 [2023-11-29 02:09:28,764 INFO L226 Difference]: Without dead ends: 1633 [2023-11-29 02:09:28,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=164, Unknown=2, NotChecked=54, Total=272 [2023-11-29 02:09:28,765 INFO L413 NwaCegarLoop]: 664 mSDtfsCounter, 706 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 5642 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 5653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:09:28,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 3071 Invalid, 5653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 5642 Invalid, 0 Unknown, 0 Unchecked, 12.5s Time] [2023-11-29 02:09:28,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2023-11-29 02:09:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1289. [2023-11-29 02:09:28,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 767 states have (on average 1.8396349413298565) internal successors, (1411), 1278 states have internal predecessors, (1411), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:09:28,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1445 transitions. [2023-11-29 02:09:28,788 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1445 transitions. Word has length 103 [2023-11-29 02:09:28,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:09:28,789 INFO L495 AbstractCegarLoop]: Abstraction has 1289 states and 1445 transitions. [2023-11-29 02:09:28,790 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 02:09:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1445 transitions. [2023-11-29 02:09:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 02:09:28,791 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:09:28,791 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 02:09:28,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-11-29 02:09:28,999 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 02:09:29,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:09:29,192 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:09:29,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:09:29,192 INFO L85 PathProgramCache]: Analyzing trace with hash 587448315, now seen corresponding path program 1 times [2023-11-29 02:09:29,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:09:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009117652] [2023-11-29 02:09:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:09:29,193 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 02:09:29,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:09:29,193 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:09:29,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:09:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:29,902 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-29 02:09:29,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:09:29,911 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 02:09:30,009 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:09:30,009 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 02:09:30,031 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 02:09:30,115 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 02:09:30,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:09:30,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:09:30,920 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:09:30,920 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 02:09:30,932 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 02:09:30,960 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 02:09:30,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:09:31,005 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3572) |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 02:09:31,015 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3572) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 02:09:31,373 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3572 (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_3618))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3572)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:09:31,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:09:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1009117652] [2023-11-29 02:09:31,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1009117652] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:09:31,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408496401] [2023-11-29 02:09:31,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:09:31,376 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:09:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:09:31,377 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:09:31,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-11-29 02:09:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:35,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:09:35,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:09:35,042 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:09:35,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:09:35,414 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:09:35,415 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 20 treesize of output 22 [2023-11-29 02:09:35,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:09:36,013 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:09:36,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:09:36,145 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:09:36,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:09:36,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:09:36,192 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 02:09:36,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:09:36,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4023) |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 02:09:36,213 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-11-29 02:09:36,601 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-11-29 02:09:36,601 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 02:09:36,610 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4069 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4023 (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_4069))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4023)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 02:09:36,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [408496401] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:09:36,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:09:36,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2023-11-29 02:09:36,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629999514] [2023-11-29 02:09:36,612 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:09:36,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 02:09:36,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:09:36,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 02:09:36,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=446, Unknown=6, NotChecked=282, Total=812 [2023-11-29 02:09:36,614 INFO L87 Difference]: Start difference. First operand 1289 states and 1445 transitions. Second operand has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 20 states have internal predecessors, (122), 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 02:09:51,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:09:51,871 INFO L93 Difference]: Finished difference Result 2408 states and 2614 transitions. [2023-11-29 02:09:51,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:09:51,871 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 20 states have internal predecessors, (122), 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 02:09:51,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:09:51,878 INFO L225 Difference]: With dead ends: 2408 [2023-11-29 02:09:51,878 INFO L226 Difference]: Without dead ends: 2408 [2023-11-29 02:09:51,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1152, Unknown=6, NotChecked=450, Total=1806 [2023-11-29 02:09:51,879 INFO L413 NwaCegarLoop]: 513 mSDtfsCounter, 3186 mSDsluCounter, 5707 mSDsCounter, 0 mSdLazyCounter, 8145 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3209 SdHoareTripleChecker+Valid, 6220 SdHoareTripleChecker+Invalid, 8269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 8145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:09:51,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3209 Valid, 6220 Invalid, 8269 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 8145 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2023-11-29 02:09:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2023-11-29 02:09:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 1288. [2023-11-29 02:09:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 767 states have (on average 1.8383311603650587) internal successors, (1410), 1277 states have internal predecessors, (1410), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:09:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1444 transitions. [2023-11-29 02:09:51,903 INFO L78 Accepts]: Start accepts. Automaton has 1288 states and 1444 transitions. Word has length 105 [2023-11-29 02:09:51,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:09:51,903 INFO L495 AbstractCegarLoop]: Abstraction has 1288 states and 1444 transitions. [2023-11-29 02:09:51,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.777777777777778) internal successors, (122), 20 states have internal predecessors, (122), 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 02:09:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1288 states and 1444 transitions. [2023-11-29 02:09:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-11-29 02:09:51,905 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:09:51,905 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:09:51,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:09:52,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-11-29 02:09:52,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:09:52,306 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:09:52,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:09:52,307 INFO L85 PathProgramCache]: Analyzing trace with hash 587448316, now seen corresponding path program 1 times [2023-11-29 02:09:52,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:09:52,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [669079081] [2023-11-29 02:09:52,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:09:52,308 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 02:09:52,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:09:52,309 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:09:52,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:09:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:53,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-29 02:09:53,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:09:53,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 02:09:53,251 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 02:09:53,262 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:09:53,262 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 02:09:53,282 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 02:09:53,288 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 02:09:53,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:09:53,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:09:53,911 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:09:53,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:09:53,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:09:54,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:09:54,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:09:54,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:09:54,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:09:54,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:09:54,073 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 02:09:54,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:09:54,239 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4522 (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_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4521 (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_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:09:54,271 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_4522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_4522) |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 02:09:55,561 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4522 (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_4614) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4613) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_4614 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4613))) (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_4614) .cse2 v_ArrVal_4522) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:09:55,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:09:55,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [669079081] [2023-11-29 02:09:55,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [669079081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:09:55,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1470298225] [2023-11-29 02:09:55,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:09:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:09:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:09:55,573 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:09:55,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-11-29 02:09:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:09:59,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 113 conjunts are in the unsatisfiable core [2023-11-29 02:09:59,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:09:59,074 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 02:09:59,281 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 02:09:59,296 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:09:59,296 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 02:09:59,357 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 02:09:59,363 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 02:09:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 02:09:59,519 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 02:10:00,081 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:10:00,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:10:00,087 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 02:10:00,244 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:10:00,244 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 02:10:00,254 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 02:10:00,268 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 02:10:00,274 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 02:10:00,276 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 02:10:00,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:10:00,329 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (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_5066) |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_5067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5066 (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_5066) |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 02:10:00,362 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_5066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#3.base| .cse0 v_ArrVal_5067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_5066) |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 02:10:01,606 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5067 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5158))) (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_5159) .cse0 v_ArrVal_5066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5067) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5158 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5066 (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_5159) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5158) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5066) |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 02:10:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1470298225] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:10:01,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:10:01,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-11-29 02:10:01,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543040033] [2023-11-29 02:10:01,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:10:01,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:10:01,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:10:01,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:10:01,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=228, Unknown=6, NotChecked=210, Total=506 [2023-11-29 02:10:01,616 INFO L87 Difference]: Start difference. First operand 1288 states and 1444 transitions. Second operand has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:10:20,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:20,068 INFO L93 Difference]: Finished difference Result 1641 states and 1766 transitions. [2023-11-29 02:10:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:10:20,068 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-11-29 02:10:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:20,072 INFO L225 Difference]: With dead ends: 1641 [2023-11-29 02:10:20,072 INFO L226 Difference]: Without dead ends: 1641 [2023-11-29 02:10:20,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=375, Unknown=6, NotChecked=270, Total=756 [2023-11-29 02:10:20,073 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1126 mSDsluCounter, 3596 mSDsCounter, 0 mSdLazyCounter, 9389 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 4205 SdHoareTripleChecker+Invalid, 9409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 9389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:20,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 4205 Invalid, 9409 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [20 Valid, 9389 Invalid, 0 Unknown, 0 Unchecked, 18.1s Time] [2023-11-29 02:10:20,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2023-11-29 02:10:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1287. [2023-11-29 02:10:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 767 states have (on average 1.8370273794002607) internal successors, (1409), 1276 states have internal predecessors, (1409), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:10:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1443 transitions. [2023-11-29 02:10:20,094 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1443 transitions. Word has length 105 [2023-11-29 02:10:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:20,095 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1443 transitions. [2023-11-29 02:10:20,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 9.666666666666666) internal successors, (116), 15 states have internal predecessors, (116), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:10:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1443 transitions. [2023-11-29 02:10:20,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 02:10:20,096 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:20,096 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 02:10:20,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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)] Forceful destruction successful, exit code 0 [2023-11-29 02:10:20,309 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (27)] Ended with exit code 0 [2023-11-29 02:10:20,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:10:20,497 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:10:20,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:20,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1899106476, now seen corresponding path program 1 times [2023-11-29 02:10:20,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:10:20,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273576439] [2023-11-29 02:10:20,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:20,498 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 02:10:20,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:10:20,499 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:10:20,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:10:21,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:21,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 02:10:21,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:10:21,384 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 02:10:21,501 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:10:21,501 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 02:10:21,526 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 02:10:21,603 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 02:10:22,356 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:10:22,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 02:10:22,454 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:10:22,454 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 02:10:22,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:10:22,526 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 02:10:22,538 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 02:10:22,574 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 02:10:22,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:10:22,629 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5581) |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 02:10:22,639 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5581 (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_5581) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:10:22,651 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5581 (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_5580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:10:22,662 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5580))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:10:22,983 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5627 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5580 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5581 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5627))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5580)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5581)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:10:22,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:10:22,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273576439] [2023-11-29 02:10:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273576439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:10:22,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [459083118] [2023-11-29 02:10:22,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:22,988 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:10:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:10:22,989 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:10:22,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 02:10:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,411 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 02:10:57,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:10:57,456 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:10:57,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:10:57,833 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:10:57,833 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 20 treesize of output 22 [2023-11-29 02:10:57,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:10:58,483 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:10:58,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:10:58,647 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:10:58,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:10:58,756 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:10:58,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:10:58,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:10:58,818 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 02:10:58,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:11:02,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6048 (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_6048) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:11:02,948 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6047 (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_6047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6048)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:11:02,962 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6047 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6047))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6048)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:11:03,415 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-11-29 02:11:03,416 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 02:11:03,427 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6094 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6048 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6047 (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 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6094))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6047)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6048)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-11-29 02:11:03,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [459083118] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:11:03,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:11:03,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 22 [2023-11-29 02:11:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900900485] [2023-11-29 02:11:03,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:11:03,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 02:11:03,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:11:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 02:11:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=574, Unknown=14, NotChecked=504, Total=1190 [2023-11-29 02:11:03,433 INFO L87 Difference]: Start difference. First operand 1287 states and 1443 transitions. Second operand has 23 states, 20 states have (on average 6.3) internal successors, (126), 22 states have internal predecessors, (126), 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 02:11:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:11:27,837 INFO L93 Difference]: Finished difference Result 2404 states and 2610 transitions. [2023-11-29 02:11:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 02:11:27,838 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.3) internal successors, (126), 22 states have internal predecessors, (126), 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 02:11:27,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:11:27,843 INFO L225 Difference]: With dead ends: 2404 [2023-11-29 02:11:27,843 INFO L226 Difference]: Without dead ends: 2404 [2023-11-29 02:11:27,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=232, Invalid=1430, Unknown=14, NotChecked=774, Total=2450 [2023-11-29 02:11:27,845 INFO L413 NwaCegarLoop]: 512 mSDtfsCounter, 2471 mSDsluCounter, 7281 mSDsCounter, 0 mSdLazyCounter, 10455 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 7793 SdHoareTripleChecker+Invalid, 10561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 10455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:11:27,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 7793 Invalid, 10561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [106 Valid, 10455 Invalid, 0 Unknown, 0 Unchecked, 23.4s Time] [2023-11-29 02:11:27,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2023-11-29 02:11:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1286. [2023-11-29 02:11:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 767 states have (on average 1.8357235984354627) internal successors, (1408), 1275 states have internal predecessors, (1408), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:11:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1442 transitions. [2023-11-29 02:11:27,863 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1442 transitions. Word has length 107 [2023-11-29 02:11:27,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:11:27,863 INFO L495 AbstractCegarLoop]: Abstraction has 1286 states and 1442 transitions. [2023-11-29 02:11:27,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.3) internal successors, (126), 22 states have internal predecessors, (126), 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 02:11:27,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1442 transitions. [2023-11-29 02:11:27,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 02:11:27,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:11:27,864 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 02:11:27,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2023-11-29 02:11:28,095 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Ended with exit code 0 [2023-11-29 02:11:28,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:11:28,265 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:11:28,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:28,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1899106477, now seen corresponding path program 1 times [2023-11-29 02:11:28,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:11:28,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629834890] [2023-11-29 02:11:28,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:28,266 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 02:11:28,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:11:28,267 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:11:28,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:11:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:29,292 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 114 conjunts are in the unsatisfiable core [2023-11-29 02:11:29,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:11:29,307 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 02:11:29,440 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:11:29,440 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 02:11:29,450 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 02:11:29,477 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 02:11:29,496 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 02:11:29,605 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 02:11:29,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:11:30,345 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:11:30,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:11:30,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:11:30,490 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:11:30,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:11:30,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:11:30,598 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:11:30,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 02:11:30,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 02:11:30,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 02:11:30,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 02:11:30,665 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 02:11:30,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:11:30,846 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6563 (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_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (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_6563) |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_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:11:30,881 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_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6563) |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_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:11:30,985 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6562))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6561) .cse0 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6561) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 02:11:31,110 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_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_6561) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_6562))) (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_6561) .cse3 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:11:33,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (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_6655))) (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_6656) .cse1 v_ArrVal_6561) (select (select (store .cse2 .cse1 v_ArrVal_6562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_6563))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_6655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6561 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6562 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6563 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6564 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6655))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_6562))) (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_6656) .cse4 v_ArrVal_6561) .cse5 v_ArrVal_6563) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_6564) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:11:33,858 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:11:33,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629834890] [2023-11-29 02:11:33,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629834890] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:11:33,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1755226048] [2023-11-29 02:11:33,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:33,859 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:11:33,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:11:33,860 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:11:33,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 02:12:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:10,909 INFO L262 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 117 conjunts are in the unsatisfiable core [2023-11-29 02:12:10,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:10,932 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 02:12:11,497 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:12:11,498 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 02:12:11,508 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 02:12:11,606 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 02:12:11,618 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 02:12:11,899 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 02:12:11,905 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 02:12:12,954 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:12:12,955 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 02:12:12,968 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 02:12:13,276 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:12:13,276 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 02:12:13,295 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 02:12:13,479 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:12:13,479 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 02:12:13,488 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 02:12:13,522 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 02:12:13,529 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 02:12:13,540 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 02:12:13,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:12:13,611 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (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_7126) |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_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7126 (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_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 02:12:13,650 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_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7126) |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_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_7126) |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 02:12:13,766 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (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_7123) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7124))) (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_7123) .cse2 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 02:12:13,869 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_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_7123) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_7124))) (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_7123) .cse3 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:12:16,281 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7125 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7218))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7124))) (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_7217) .cse0 v_ArrVal_7123) .cse1 v_ArrVal_7126) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7125) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7218 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7126 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7217 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7123 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7124 (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_7218))) (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_7217) .cse6 v_ArrVal_7123) (select (select (store .cse7 .cse6 v_ArrVal_7124) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7126))) |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 02:12:16,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1755226048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:12:16,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:12:16,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-11-29 02:12:16,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900642350] [2023-11-29 02:12:16,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:12:16,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 02:12:16,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:12:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 02:12:16,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=292, Unknown=10, NotChecked=430, Total=812 [2023-11-29 02:12:16,300 INFO L87 Difference]: Start difference. First operand 1286 states and 1442 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:12:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:49,866 INFO L93 Difference]: Finished difference Result 1639 states and 1764 transitions. [2023-11-29 02:12:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:12:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-11-29 02:12:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:49,869 INFO L225 Difference]: With dead ends: 1639 [2023-11-29 02:12:49,869 INFO L226 Difference]: Without dead ends: 1639 [2023-11-29 02:12:49,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 198 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=133, Invalid=497, Unknown=10, NotChecked=550, Total=1190 [2023-11-29 02:12:49,870 INFO L413 NwaCegarLoop]: 609 mSDtfsCounter, 1117 mSDsluCounter, 3284 mSDsCounter, 0 mSdLazyCounter, 8555 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 3893 SdHoareTripleChecker+Invalid, 8573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 8555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:49,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 3893 Invalid, 8573 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 8555 Invalid, 0 Unknown, 0 Unchecked, 32.9s Time] [2023-11-29 02:12:49,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2023-11-29 02:12:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1285. [2023-11-29 02:12:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 767 states have (on average 1.834419817470665) internal successors, (1407), 1274 states have internal predecessors, (1407), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:12:49,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1441 transitions. [2023-11-29 02:12:49,882 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1441 transitions. Word has length 107 [2023-11-29 02:12:49,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:49,882 INFO L495 AbstractCegarLoop]: Abstraction has 1285 states and 1441 transitions. [2023-11-29 02:12:49,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 02:12:49,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1441 transitions. [2023-11-29 02:12:49,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 02:12:49,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:49,883 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 02:12:49,894 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 02:12:50,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-11-29 02:12:50,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:12:50,284 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:12:50,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:50,284 INFO L85 PathProgramCache]: Analyzing trace with hash -317790408, now seen corresponding path program 1 times [2023-11-29 02:12:50,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:12:50,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221488423] [2023-11-29 02:12:50,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:50,285 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 02:12:50,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:12:50,286 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:12:50,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:12:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:51,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-29 02:12:51,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:51,334 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 02:12:51,598 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:12:51,598 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 02:12:51,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 02:12:51,812 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 02:12:53,241 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:12:53,241 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 02:12:53,427 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:12:53,427 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 02:12:53,577 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:12:53,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 44 treesize of output 43 [2023-11-29 02:12:53,732 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:12:53,732 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 02:12:53,759 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 02:12:53,831 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 02:12:53,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:12:58,048 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (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_7656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:12:58,071 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (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~mem36#1.base| v_ArrVal_7655))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:12:58,095 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:12:58,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7654 (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_7654))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:12:58,150 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7654 (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| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7654))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:12:58,796 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7702 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7654 (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_7702))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7654)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7655)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7656)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:12:58,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:12:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221488423] [2023-11-29 02:12:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221488423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:12:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1963403855] [2023-11-29 02:12:58,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:58,803 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:12:58,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:12:58,804 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:12:58,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 02:13:44,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:44,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 02:13:44,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:44,297 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:13:44,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:13:45,195 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:13:45,195 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 20 treesize of output 22 [2023-11-29 02:13:45,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:13:46,625 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:13:46,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:13:46,976 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:13:46,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:13:47,194 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:13:47,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:13:47,427 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:13:47,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:13:47,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:13:47,579 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 02:13:47,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:13:47,610 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_8139) |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 02:13:47,633 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (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_8139) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:13:47,659 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8138))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:13:47,682 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:13:47,709 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:13:47,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8137 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8137))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:13:48,406 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-11-29 02:13:48,406 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 02:13:48,430 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8139 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8138 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8137 (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_8185))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8137)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8138)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8139)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 02:13:48,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1963403855] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:13:48,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:13:48,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 24 [2023-11-29 02:13:48,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859241433] [2023-11-29 02:13:48,436 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:13:48,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 02:13:48,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:13:48,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 02:13:48,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=677, Unknown=15, NotChecked=832, Total=1640 [2023-11-29 02:13:48,438 INFO L87 Difference]: Start difference. First operand 1285 states and 1441 transitions. Second operand has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 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 02:14:25,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:14:25,780 INFO L93 Difference]: Finished difference Result 2400 states and 2606 transitions. [2023-11-29 02:14:25,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 02:14:25,780 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 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 02:14:25,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:14:25,786 INFO L225 Difference]: With dead ends: 2400 [2023-11-29 02:14:25,786 INFO L226 Difference]: Without dead ends: 2400 [2023-11-29 02:14:25,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 196 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=263, Invalid=1666, Unknown=15, NotChecked=1248, Total=3192 [2023-11-29 02:14:25,788 INFO L413 NwaCegarLoop]: 511 mSDtfsCounter, 3160 mSDsluCounter, 6625 mSDsCounter, 0 mSdLazyCounter, 9493 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3183 SdHoareTripleChecker+Valid, 7136 SdHoareTripleChecker+Invalid, 9617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 9493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:14:25,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3183 Valid, 7136 Invalid, 9617 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [124 Valid, 9493 Invalid, 0 Unknown, 0 Unchecked, 35.7s Time] [2023-11-29 02:14:25,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2023-11-29 02:14:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1284. [2023-11-29 02:14:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 767 states have (on average 1.833116036505867) internal successors, (1406), 1273 states have internal predecessors, (1406), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:14:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1440 transitions. [2023-11-29 02:14:25,809 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1440 transitions. Word has length 109 [2023-11-29 02:14:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:14:25,810 INFO L495 AbstractCegarLoop]: Abstraction has 1284 states and 1440 transitions. [2023-11-29 02:14:25,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.909090909090909) internal successors, (130), 24 states have internal predecessors, (130), 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 02:14:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1440 transitions. [2023-11-29 02:14:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-11-29 02:14:25,811 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:14:25,811 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 02:14:25,820 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:14:26,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 02:14:26,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:14:26,212 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:14:26,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:14:26,212 INFO L85 PathProgramCache]: Analyzing trace with hash -317790407, now seen corresponding path program 1 times [2023-11-29 02:14:26,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:14:26,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789776653] [2023-11-29 02:14:26,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:14:26,213 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 02:14:26,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:14:26,213 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:14:26,214 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:14:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:14:27,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 118 conjunts are in the unsatisfiable core [2023-11-29 02:14:27,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:14:27,536 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 02:14:28,012 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:14:28,012 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 02:14:28,024 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 02:14:28,088 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 02:14:28,095 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 02:14:28,288 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 02:14:28,295 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 02:14:29,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:14:29,508 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 02:14:29,520 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 02:14:29,719 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:14:29,720 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 02:14:29,737 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 02:14:29,886 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:14:29,887 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 02:14:29,895 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 02:14:30,055 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:14:30,055 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 02:14:30,072 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 02:14:30,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 02:14:30,097 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 02:14:30,157 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 02:14:30,157 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:14:30,387 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (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_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (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_8672) |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_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 02:14:30,430 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_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8672) |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_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#3.offset| .cse0 v_ArrVal_8672) |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 02:14:30,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8669))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8670) .cse0 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8670) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 02:14:30,557 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_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_8670) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8669))) (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_8670) .cse3 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:14:30,625 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8668))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8669))) (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_8667) .cse0 v_ArrVal_8670) .cse1 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (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_8668))) (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_8667) .cse6 v_ArrVal_8670) (select (select (store .cse7 .cse6 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8672))) |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 02:14:30,696 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_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8668))) (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_8667) .cse2 v_ArrVal_8670) (select (select (store .cse3 .cse2 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8672))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_8668))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_8669))) (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_8667) .cse5 v_ArrVal_8670) .cse6 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 02:14:32,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8763 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8764))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_8668))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_8669))) (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_8763) .cse0 v_ArrVal_8667) .cse1 v_ArrVal_8670) .cse2 v_ArrVal_8672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_8671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_8672 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8670 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8669 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8668 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8667 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8763 (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_8764))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_8668))) (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_8763) .cse8 v_ArrVal_8667) .cse9 v_ArrVal_8670) (select (select (store .cse10 .cse9 v_ArrVal_8669) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8672))))) |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 02:14:32,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:14:32,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789776653] [2023-11-29 02:14:32,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789776653] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:14:32,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1239389575] [2023-11-29 02:14:32,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:14:32,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:14:32,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:14:32,182 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:14:32,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 02:15:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:15:17,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 838 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 02:15:17,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:15:17,528 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 02:15:18,023 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 02:15:18,023 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 02:15:18,045 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 02:15:18,061 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 02:15:18,090 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 02:15:18,203 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 02:15:18,211 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 02:15:19,300 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:15:19,300 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 02:15:19,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 02:15:19,442 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:15:19,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:15:19,454 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 02:15:19,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:15:19,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 02:15:19,543 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 02:15:19,641 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:15:19,642 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 02:15:19,650 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 02:15:19,682 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 02:15:19,694 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 02:15:19,702 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 02:15:19,702 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:15:19,776 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (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_9250) |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_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9250 (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_9250) |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 02:15:19,822 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_9250 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9250) |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_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 02:15:19,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9249))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9248) .cse0 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#3.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9248) (select (select (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 02:15:20,031 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_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#3.offset| .cse1 v_ArrVal_9248) (select (select (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#3.base| .cse1 v_ArrVal_9249))) (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_9248) .cse3 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 02:15:21,234 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9246))) (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~mem35#1.base| v_ArrVal_9247) .cse1 v_ArrVal_9248) (select (select (store .cse2 .cse1 v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9250))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9246))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_9249))) (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~mem35#1.base| v_ArrVal_9247) .cse4 v_ArrVal_9248) .cse5 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-11-29 02:15:38,386 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9251 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9342))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_9246))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_9249))) (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_9343) .cse0 v_ArrVal_9247) .cse1 v_ArrVal_9248) .cse2 v_ArrVal_9250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_9251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_9343 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9342 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9250 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9249 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9248 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9247 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9246 (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_9342))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_9246))) (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_9343) .cse8 v_ArrVal_9247) .cse9 v_ArrVal_9248) (select (select (store .cse10 .cse9 v_ArrVal_9249) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_9250))))) |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 02:15:38,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1239389575] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:15:38,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:15:38,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2023-11-29 02:15:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423387037] [2023-11-29 02:15:38,418 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:15:38,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:15:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:15:38,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:15:38,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=175, Unknown=18, NotChecked=494, Total=756 [2023-11-29 02:15:38,419 INFO L87 Difference]: Start difference. First operand 1284 states and 1440 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 02:17:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:17:09,292 INFO L93 Difference]: Finished difference Result 1627 states and 1751 transitions. [2023-11-29 02:17:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:17:09,293 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 02:17:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:17:09,296 INFO L225 Difference]: With dead ends: 1627 [2023-11-29 02:17:09,296 INFO L226 Difference]: Without dead ends: 1627 [2023-11-29 02:17:09,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=120, Invalid=375, Unknown=19, NotChecked=676, Total=1190 [2023-11-29 02:17:09,297 INFO L413 NwaCegarLoop]: 662 mSDtfsCounter, 697 mSDsluCounter, 2411 mSDsCounter, 0 mSdLazyCounter, 5623 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 84.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 3073 SdHoareTripleChecker+Invalid, 5634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 5623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:17:09,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 3073 Invalid, 5634 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 5623 Invalid, 0 Unknown, 0 Unchecked, 87.5s Time] [2023-11-29 02:17:09,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2023-11-29 02:17:09,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1283. [2023-11-29 02:17:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1283 states, 767 states have (on average 1.8318122555410692) internal successors, (1405), 1272 states have internal predecessors, (1405), 16 states have call successors, (16), 4 states have call predecessors, (16), 5 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2023-11-29 02:17:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1439 transitions. [2023-11-29 02:17:09,324 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1439 transitions. Word has length 109 [2023-11-29 02:17:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:17:09,324 INFO L495 AbstractCegarLoop]: Abstraction has 1283 states and 1439 transitions. [2023-11-29 02:17:09,324 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 02:17:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1439 transitions. [2023-11-29 02:17:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-11-29 02:17:09,325 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:17:09,325 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 02:17:09,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 02:17:09,562 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 02:17:09,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 02:17:09,726 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 750 more)] === [2023-11-29 02:17:09,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:17:09,726 INFO L85 PathProgramCache]: Analyzing trace with hash -451859169, now seen corresponding path program 1 times [2023-11-29 02:17:09,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:17:09,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851008974] [2023-11-29 02:17:09,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:09,727 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 02:17:09,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:17:09,728 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:17:09,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -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 02:17:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:11,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 02:17:11,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:17:11,133 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 02:17:12,747 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 02:17:12,748 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 02:17:12,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 19 treesize of output 1 [2023-11-29 02:17:13,782 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 02:17:20,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:17:20,472 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 02:17:21,406 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:17:21,406 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 02:17:22,136 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:17:22,136 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 02:17:22,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:17:22,836 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 02:17:23,586 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 02:17:23,587 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 02:17:23,709 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 02:17:24,045 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-11-29 02:17:24,046 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 02:17:24,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 02:17:24,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:17:25,331 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (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_9799) |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 02:17:25,407 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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_9799) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 02:17:25,486 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (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_9798))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:17:25,566 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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 (store |c_#memory_$Pointer$#3.base| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:17:25,649 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (bvadd (_ bv1 1) (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_9797))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 02:17:25,734 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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| (select (select |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:17:25,821 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9796 (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_9796))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:17:25,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9796 (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_9796))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:17:27,828 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9799 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9797 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32)) (v_ArrVal_9796 (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 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9846))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9796)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9797)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9798)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9799)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:17:27,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:17:27,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851008974] [2023-11-29 02:17:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851008974] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:17:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1395224356] [2023-11-29 02:17:27,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:17:27,849 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 02:17:27,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 02:17:27,850 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 02:17:27,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58bc91a5-5795-42d9-921e-9f9db92137a0/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 02:17:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:17:40,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 874 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 02:17:40,931 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:17:41,417 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 02:17:41,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 02:17:45,966 INFO L349 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-11-29 02:17:45,967 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 20 treesize of output 22 [2023-11-29 02:17:46,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 02:17:52,672 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:17:52,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:17:54,343 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:17:54,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:17:55,361 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:17:55,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:17:56,433 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:17:56,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 41 [2023-11-29 02:17:57,522 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 02:17:57,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 44 treesize of output 41 [2023-11-29 02:17:57,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 02:17:57,953 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-29 02:17:57,954 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 20 [2023-11-29 02:17:58,565 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 02:17:58,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:18:00,510 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (_ bv0 1) (bvadd (_ bv1 1) (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_10301) |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 02:18:00,585 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ BitVec 32))) (= (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_10301) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:18:00,664 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:18:00,743 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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_10300))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:18:00,827 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10299))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:18:00,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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_10299))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:18:01,004 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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_10298))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 02:18:01,095 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc40#1.base_16| (_ 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 (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_10298))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 02:18:03,199 INFO L349 Elim1Store]: treesize reduction 7, result has 96.5 percent of original size [2023-11-29 02:18:03,199 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 591 treesize of output 590 [2023-11-29 02:18:03,281 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10301 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10348 (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 (let ((.cse4 (store |c_#memory_$Pointer$#3.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10348))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10298)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10299)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10300)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10301)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-11-29 02:18:03,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1395224356] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:18:03,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:18:03,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 26 [2023-11-29 02:18:03,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420571368] [2023-11-29 02:18:03,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:18:03,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 02:18:03,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:18:03,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 02:18:03,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=734, Unknown=18, NotChecked=1278, Total=2162 [2023-11-29 02:18:03,303 INFO L87 Difference]: Start difference. First operand 1283 states and 1439 transitions. Second operand has 27 states, 24 states have (on average 5.583333333333333) internal successors, (134), 26 states have internal predecessors, (134), 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)