./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:59:27,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:59:27,888 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 12:59:27,893 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:59:27,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:59:27,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:59:27,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:59:27,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:59:27,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:59:27,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:59:27,924 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:59:27,925 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:59:27,925 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:59:27,926 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 12:59:27,926 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:59:27,927 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:59:27,927 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 12:59:27,928 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 12:59:27,929 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:59:27,929 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 12:59:27,930 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 12:59:27,931 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 12:59:27,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:59:27,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:59:27,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:59:27,933 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:59:27,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:59:27,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:59:27,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:59:27,935 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:59:27,935 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:59:27,936 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:59:27,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:59:27,936 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:59:27,936 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:59:27,937 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:59:27,937 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:59:27,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:59:27,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:59:27,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:59:27,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:59:27,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:59:27,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:59:27,939 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 12:59:27,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 12:59:27,939 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:59:27,939 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:59:27,940 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:59:27,940 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/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_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2023-12-02 12:59:28,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:59:28,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:59:28,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:59:28,203 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:59:28,203 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:59:28,205 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2023-12-02 12:59:31,049 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:59:31,428 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:59:31,429 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2023-12-02 12:59:31,452 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data/a95ad56ba/411846729fca4daea0ccc1499ca26f90/FLAGf68b677c7 [2023-12-02 12:59:31,470 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data/a95ad56ba/411846729fca4daea0ccc1499ca26f90 [2023-12-02 12:59:31,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:59:31,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:59:31,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:59:31,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:59:31,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:59:31,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:31" (1/1) ... [2023-12-02 12:59:31,486 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b606fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:31, skipping insertion in model container [2023-12-02 12:59:31,486 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:31" (1/1) ... [2023-12-02 12:59:31,580 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:59:32,348 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:59:32,362 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-12-02 12:59:32,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@737d7623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:32, skipping insertion in model container [2023-12-02 12:59:32,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:59:32,363 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 12:59:32,365 INFO L158 Benchmark]: Toolchain (without parser) took 889.38ms. Allocated memory is still 138.4MB. Free memory was 108.2MB in the beginning and 85.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 12:59:32,366 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 138.4MB. Free memory was 99.5MB in the beginning and 99.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 12:59:32,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 886.61ms. Allocated memory is still 138.4MB. Free memory was 108.2MB in the beginning and 85.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-12-02 12:59:32,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 138.4MB. Free memory was 99.5MB in the beginning and 99.3MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 886.61ms. Allocated memory is still 138.4MB. Free memory was 108.2MB in the beginning and 85.6MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 12:59:34,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 12:59:34,238 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 12:59:34,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 12:59:34,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 12:59:34,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 12:59:34,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 12:59:34,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 12:59:34,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 12:59:34,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 12:59:34,280 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 12:59:34,281 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 12:59:34,282 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 12:59:34,282 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 12:59:34,283 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 12:59:34,283 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 12:59:34,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 12:59:34,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 12:59:34,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 12:59:34,286 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 12:59:34,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 12:59:34,291 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 12:59:34,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 12:59:34,292 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 12:59:34,292 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 12:59:34,292 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 12:59:34,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 12:59:34,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 12:59:34,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 12:59:34,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 12:59:34,294 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 12:59:34,295 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 12:59:34,295 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 12:59:34,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 12:59:34,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 12:59:34,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 12:59:34,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 12:59:34,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:59:34,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 12:59:34,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 12:59:34,297 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 12:59:34,298 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 12:59:34,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 12:59:34,298 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 12:59:34,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 12:59:34,299 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/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_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh 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 -> Taipan 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2023-12-02 12:59:34,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 12:59:34,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 12:59:34,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 12:59:34,618 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 12:59:34,618 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 12:59:34,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2023-12-02 12:59:37,368 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 12:59:37,671 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 12:59:37,671 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2023-12-02 12:59:37,692 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data/d4d547070/d9b853b9100e45b3b10b5bf0abe35b3a/FLAG73fa094eb [2023-12-02 12:59:37,706 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/data/d4d547070/d9b853b9100e45b3b10b5bf0abe35b3a [2023-12-02 12:59:37,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 12:59:37,710 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 12:59:37,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 12:59:37,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 12:59:37,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 12:59:37,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:37" (1/1) ... [2023-12-02 12:59:37,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2861c6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:37, skipping insertion in model container [2023-12-02 12:59:37,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:59:37" (1/1) ... [2023-12-02 12:59:37,775 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:59:38,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:59:38,481 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 12:59:38,501 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 12:59:38,593 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:59:38,599 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 12:59:38,693 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 12:59:38,782 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 12:59:38,790 INFO L206 MainTranslator]: Completed translation [2023-12-02 12:59:38,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38 WrapperNode [2023-12-02 12:59:38,791 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 12:59:38,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 12:59:38,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 12:59:38,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 12:59:38,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,842 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,898 INFO L138 Inliner]: procedures = 285, calls = 298, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1048 [2023-12-02 12:59:38,899 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 12:59:38,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 12:59:38,900 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 12:59:38,900 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 12:59:38,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,987 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:38,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:39,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:39,016 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 12:59:39,017 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 12:59:39,017 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 12:59:39,017 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 12:59:39,018 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (1/1) ... [2023-12-02 12:59:39,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 12:59:39,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 12:59:39,060 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 12:59:39,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 12:59:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 12:59:39,093 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 12:59:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 12:59:39,094 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-12-02 12:59:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-12-02 12:59:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 12:59:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 12:59:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 12:59:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 12:59:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-12-02 12:59:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-12-02 12:59:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 12:59:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-12-02 12:59:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-12-02 12:59:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 12:59:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 12:59:39,332 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 12:59:39,334 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 12:59:44,055 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 12:59:44,248 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 12:59:44,248 INFO L309 CfgBuilder]: Removed 63 assume(true) statements. [2023-12-02 12:59:44,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:44 BoogieIcfgContainer [2023-12-02 12:59:44,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 12:59:44,252 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 12:59:44,252 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 12:59:44,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 12:59:44,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:59:37" (1/3) ... [2023-12-02 12:59:44,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25169e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:59:44, skipping insertion in model container [2023-12-02 12:59:44,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:59:38" (2/3) ... [2023-12-02 12:59:44,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25169e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:59:44, skipping insertion in model container [2023-12-02 12:59:44,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:59:44" (3/3) ... [2023-12-02 12:59:44,258 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2023-12-02 12:59:44,275 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 12:59:44,275 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 528 error locations. [2023-12-02 12:59:44,343 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 12:59:44,351 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=FINITE_AUTOMATA, 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;@69bc17c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 12:59:44,351 INFO L358 AbstractCegarLoop]: Starting to check reachability of 528 error locations. [2023-12-02 12:59:44,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-02 12:59:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:59:44,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:44,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:59:44,368 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 12:59:44,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 55333, now seen corresponding path program 1 times [2023-12-02 12:59:44,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:59:44,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [310818624] [2023-12-02 12:59:44,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:44,389 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-12-02 12:59:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:59:44,391 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:44,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:44,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 12:59:44,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:44,626 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-12-02 12:59:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:44,639 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:44,640 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:59:44,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [310818624] [2023-12-02 12:59:44,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [310818624] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:44,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:59:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460107269] [2023-12-02 12:59:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:44,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:44,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:59:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:44,686 INFO L87 Difference]: Start difference. First operand has 982 states, 431 states have (on average 2.51508120649652) internal successors, (1084), 962 states have internal predecessors, (1084), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:46,960 INFO L93 Difference]: Finished difference Result 1054 states and 1123 transitions. [2023-12-02 12:59:46,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 12:59:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:46,984 INFO L225 Difference]: With dead ends: 1054 [2023-12-02 12:59:46,999 INFO L226 Difference]: Without dead ends: 1053 [2023-12-02 12:59:47,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:47,004 INFO L413 NwaCegarLoop]: 661 mSDtfsCounter, 650 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:47,005 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 862 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-02 12:59:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2023-12-02 12:59:47,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2023-12-02 12:59:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 459 states have (on average 2.3398692810457518) internal successors, (1074), 977 states have internal predecessors, (1074), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 12:59:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1104 transitions. [2023-12-02 12:59:47,085 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1104 transitions. Word has length 2 [2023-12-02 12:59:47,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:47,085 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1104 transitions. [2023-12-02 12:59:47,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1104 transitions. [2023-12-02 12:59:47,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 12:59:47,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:47,086 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 12:59:47,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:47,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:47,289 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 12:59:47,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash 55334, now seen corresponding path program 1 times [2023-12-02 12:59:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:59:47,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590390201] [2023-12-02 12:59:47,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:47,291 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-12-02 12:59:47,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:59:47,292 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:47,293 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:47,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:59:47,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:47,392 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-12-02 12:59:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:47,403 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:47,403 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:59:47,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590390201] [2023-12-02 12:59:47,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590390201] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:47,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:47,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 12:59:47,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783361062] [2023-12-02 12:59:47,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:47,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:47,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:59:47,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:47,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:47,407 INFO L87 Difference]: Start difference. First operand 995 states and 1104 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:50,946 INFO L93 Difference]: Finished difference Result 1353 states and 1498 transitions. [2023-12-02 12:59:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:50,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 12:59:50,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:50,955 INFO L225 Difference]: With dead ends: 1353 [2023-12-02 12:59:50,955 INFO L226 Difference]: Without dead ends: 1353 [2023-12-02 12:59:50,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:50,957 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 382 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 1265 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:50,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 1265 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-02 12:59:50,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2023-12-02 12:59:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1165. [2023-12-02 12:59:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.3121019108280256) internal successors, (1452), 1145 states have internal predecessors, (1452), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 12:59:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1486 transitions. [2023-12-02 12:59:50,990 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1486 transitions. Word has length 2 [2023-12-02 12:59:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:50,991 INFO L495 AbstractCegarLoop]: Abstraction has 1165 states and 1486 transitions. [2023-12-02 12:59:50,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1486 transitions. [2023-12-02 12:59:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 12:59:50,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:50,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 12:59:50,994 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:51,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:51,194 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 12:59:51,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:51,195 INFO L85 PathProgramCache]: Analyzing trace with hash -435639276, now seen corresponding path program 1 times [2023-12-02 12:59:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:59:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400931504] [2023-12-02 12:59:51,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:51,196 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-12-02 12:59:51,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:59:51,197 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:51,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:51,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 12:59:51,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:51,338 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-12-02 12:59:51,344 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-12-02 12:59:51,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 12:59:51,414 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-12-02 12:59:51,438 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 12:59:51,438 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-12-02 12:59:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:51,460 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:51,461 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:59:51,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400931504] [2023-12-02 12:59:51,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400931504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:51,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:51,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:59:51,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895400284] [2023-12-02 12:59:51,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:51,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 12:59:51,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:59:51,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 12:59:51,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:59:51,463 INFO L87 Difference]: Start difference. First operand 1165 states and 1486 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:55,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:55,640 INFO L93 Difference]: Finished difference Result 1792 states and 2170 transitions. [2023-12-02 12:59:55,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 12:59:55,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 12:59:55,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:55,652 INFO L225 Difference]: With dead ends: 1792 [2023-12-02 12:59:55,652 INFO L226 Difference]: Without dead ends: 1792 [2023-12-02 12:59:55,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 12:59:55,654 INFO L413 NwaCegarLoop]: 515 mSDtfsCounter, 1292 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:55,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1013 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 12:59:55,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2023-12-02 12:59:55,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1281. [2023-12-02 12:59:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 744 states have (on average 2.293010752688172) internal successors, (1706), 1261 states have internal predecessors, (1706), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 12:59:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1740 transitions. [2023-12-02 12:59:55,695 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1740 transitions. Word has length 6 [2023-12-02 12:59:55,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:55,695 INFO L495 AbstractCegarLoop]: Abstraction has 1281 states and 1740 transitions. [2023-12-02 12:59:55,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1740 transitions. [2023-12-02 12:59:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 12:59:55,696 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:55,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:55,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:55,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:55,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 12:59:55,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:55,898 INFO L85 PathProgramCache]: Analyzing trace with hash -619915645, now seen corresponding path program 1 times [2023-12-02 12:59:55,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:59:55,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3470403] [2023-12-02 12:59:55,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:55,899 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-12-02 12:59:55,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:59:55,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:55,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:56,067 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 12:59:56,068 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:56,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 12:59:56,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 12:59:56,090 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:56,090 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:59:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3470403] [2023-12-02 12:59:56,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3470403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:56,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:59:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410020322] [2023-12-02 12:59:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:56,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:59:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:56,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:56,093 INFO L87 Difference]: Start difference. First operand 1281 states and 1740 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:58,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 12:59:58,164 INFO L93 Difference]: Finished difference Result 1760 states and 2444 transitions. [2023-12-02 12:59:58,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 12:59:58,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 12:59:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 12:59:58,175 INFO L225 Difference]: With dead ends: 1760 [2023-12-02 12:59:58,175 INFO L226 Difference]: Without dead ends: 1760 [2023-12-02 12:59:58,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:58,177 INFO L413 NwaCegarLoop]: 821 mSDtfsCounter, 869 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 12:59:58,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1073 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 12:59:58,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1760 states. [2023-12-02 12:59:58,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1760 to 1236. [2023-12-02 12:59:58,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 744 states have (on average 2.213709677419355) internal successors, (1647), 1216 states have internal predecessors, (1647), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 12:59:58,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1681 transitions. [2023-12-02 12:59:58,223 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1681 transitions. Word has length 7 [2023-12-02 12:59:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 12:59:58,224 INFO L495 AbstractCegarLoop]: Abstraction has 1236 states and 1681 transitions. [2023-12-02 12:59:58,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 12:59:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1681 transitions. [2023-12-02 12:59:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 12:59:58,225 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 12:59:58,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 12:59:58,228 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-02 12:59:58,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:58,426 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 12:59:58,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 12:59:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash -619915644, now seen corresponding path program 1 times [2023-12-02 12:59:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 12:59:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377197607] [2023-12-02 12:59:58,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 12:59:58,428 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-12-02 12:59:58,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 12:59:58,429 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:58,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 12:59:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 12:59:58,541 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 12:59:58,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 12:59:58,554 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-12-02 12:59:58,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-12-02 12:59:58,581 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 12:59:58,581 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 12:59:58,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377197607] [2023-12-02 12:59:58,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377197607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 12:59:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 12:59:58,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 12:59:58,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542527597] [2023-12-02 12:59:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 12:59:58,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 12:59:58,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 12:59:58,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 12:59:58,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 12:59:58,583 INFO L87 Difference]: Start difference. First operand 1236 states and 1681 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:02,308 INFO L93 Difference]: Finished difference Result 1793 states and 2433 transitions. [2023-12-02 13:00:02,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:00:02,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 13:00:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:02,316 INFO L225 Difference]: With dead ends: 1793 [2023-12-02 13:00:02,316 INFO L226 Difference]: Without dead ends: 1793 [2023-12-02 13:00:02,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:02,317 INFO L413 NwaCegarLoop]: 975 mSDtfsCounter, 620 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:02,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1340 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-02 13:00:02,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2023-12-02 13:00:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1226. [2023-12-02 13:00:02,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 744 states have (on average 2.181451612903226) internal successors, (1623), 1206 states have internal predecessors, (1623), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 13:00:02,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1657 transitions. [2023-12-02 13:00:02,353 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1657 transitions. Word has length 7 [2023-12-02 13:00:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:02,353 INFO L495 AbstractCegarLoop]: Abstraction has 1226 states and 1657 transitions. [2023-12-02 13:00:02,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:02,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1657 transitions. [2023-12-02 13:00:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:00:02,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:02,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:02,356 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:02,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:02,555 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:02,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash -3807760, now seen corresponding path program 1 times [2023-12-02 13:00:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:02,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373211206] [2023-12-02 13:00:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:02,556 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-12-02 13:00:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:02,556 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:02,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:02,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:00:02,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:02,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:02,733 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:02,733 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:02,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373211206] [2023-12-02 13:00:02,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373211206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:02,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:02,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:00:02,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703953035] [2023-12-02 13:00:02,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:02,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:02,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:02,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:02,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:02,735 INFO L87 Difference]: Start difference. First operand 1226 states and 1657 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:04,753 INFO L93 Difference]: Finished difference Result 1658 states and 2181 transitions. [2023-12-02 13:00:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:00:04,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 13:00:04,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:04,763 INFO L225 Difference]: With dead ends: 1658 [2023-12-02 13:00:04,763 INFO L226 Difference]: Without dead ends: 1658 [2023-12-02 13:00:04,764 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-12-02 13:00:04,765 INFO L413 NwaCegarLoop]: 922 mSDtfsCounter, 494 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 2481 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:04,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 2481 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-02 13:00:04,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2023-12-02 13:00:04,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1436. [2023-12-02 13:00:04,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 954 states have (on average 2.190775681341719) internal successors, (2090), 1416 states have internal predecessors, (2090), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 13:00:04,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2124 transitions. [2023-12-02 13:00:04,796 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2124 transitions. Word has length 12 [2023-12-02 13:00:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:04,796 INFO L495 AbstractCegarLoop]: Abstraction has 1436 states and 2124 transitions. [2023-12-02 13:00:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:04,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2124 transitions. [2023-12-02 13:00:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 13:00:04,797 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:04,797 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:04,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:04,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:04,998 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:04,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:04,998 INFO L85 PathProgramCache]: Analyzing trace with hash -592731144, now seen corresponding path program 1 times [2023-12-02 13:00:04,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:04,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944832634] [2023-12-02 13:00:04,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:04,999 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-12-02 13:00:04,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:05,000 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:05,001 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:05,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:00:05,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:05,124 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:05,124 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:05,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944832634] [2023-12-02 13:00:05,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944832634] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:05,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:05,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:00:05,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908175398] [2023-12-02 13:00:05,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:05,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:00:05,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:05,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:00:05,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:05,126 INFO L87 Difference]: Start difference. First operand 1436 states and 2124 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:06,003 INFO L93 Difference]: Finished difference Result 1352 states and 1964 transitions. [2023-12-02 13:00:06,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:00:06,005 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 13:00:06,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:06,013 INFO L225 Difference]: With dead ends: 1352 [2023-12-02 13:00:06,013 INFO L226 Difference]: Without dead ends: 1352 [2023-12-02 13:00:06,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:06,014 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 70 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:06,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1583 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-02 13:00:06,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-02 13:00:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1352. [2023-12-02 13:00:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1352 states, 894 states have (on average 2.1588366890380315) internal successors, (1930), 1332 states have internal predecessors, (1930), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-02 13:00:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 1964 transitions. [2023-12-02 13:00:06,051 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 1964 transitions. Word has length 12 [2023-12-02 13:00:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:06,052 INFO L495 AbstractCegarLoop]: Abstraction has 1352 states and 1964 transitions. [2023-12-02 13:00:06,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:06,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 1964 transitions. [2023-12-02 13:00:06,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:00:06,053 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:06,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:06,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:06,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:06,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:06,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1869888457, now seen corresponding path program 1 times [2023-12-02 13:00:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:06,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992681688] [2023-12-02 13:00:06,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:06,258 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-12-02 13:00:06,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:06,259 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:06,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:06,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 13:00:06,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:06,432 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:00:06,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:00:06,433 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:00:06,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-12-02 13:00:06,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:00:06,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-12-02 13:00:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:06,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:06,517 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992681688] [2023-12-02 13:00:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992681688] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:00:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266558968] [2023-12-02 13:00:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:06,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:06,519 INFO L87 Difference]: Start difference. First operand 1352 states and 1964 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:08,415 INFO L93 Difference]: Finished difference Result 1382 states and 1742 transitions. [2023-12-02 13:00:08,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:08,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 13:00:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:08,426 INFO L225 Difference]: With dead ends: 1382 [2023-12-02 13:00:08,426 INFO L226 Difference]: Without dead ends: 1382 [2023-12-02 13:00:08,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:08,427 INFO L413 NwaCegarLoop]: 825 mSDtfsCounter, 290 mSDsluCounter, 1580 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:08,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 2405 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 13:00:08,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2023-12-02 13:00:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1085. [2023-12-02 13:00:08,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 629 states have (on average 2.1446740858505566) internal successors, (1349), 1067 states have internal predecessors, (1349), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:00:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1379 transitions. [2023-12-02 13:00:08,454 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1379 transitions. Word has length 15 [2023-12-02 13:00:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:08,454 INFO L495 AbstractCegarLoop]: Abstraction has 1085 states and 1379 transitions. [2023-12-02 13:00:08,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1379 transitions. [2023-12-02 13:00:08,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:00:08,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:08,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:08,462 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:08,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:08,656 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:08,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1792162074, now seen corresponding path program 1 times [2023-12-02 13:00:08,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:08,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678192268] [2023-12-02 13:00:08,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:08,657 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-12-02 13:00:08,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:08,658 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:08,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:08,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 13:00:08,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:08,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:08,853 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:08,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678192268] [2023-12-02 13:00:08,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678192268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:08,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:08,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:00:08,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511760717] [2023-12-02 13:00:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:08,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:00:08,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:00:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:08,855 INFO L87 Difference]: Start difference. First operand 1085 states and 1379 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:09,569 INFO L93 Difference]: Finished difference Result 1031 states and 1299 transitions. [2023-12-02 13:00:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:00:09,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-02 13:00:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:09,575 INFO L225 Difference]: With dead ends: 1031 [2023-12-02 13:00:09,575 INFO L226 Difference]: Without dead ends: 1031 [2023-12-02 13:00:09,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:09,576 INFO L413 NwaCegarLoop]: 779 mSDtfsCounter, 70 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:09,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1509 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-02 13:00:09,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2023-12-02 13:00:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 1031. [2023-12-02 13:00:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1031 states, 599 states have (on average 2.1185308848080133) internal successors, (1269), 1013 states have internal predecessors, (1269), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:00:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1299 transitions. [2023-12-02 13:00:09,590 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1299 transitions. Word has length 15 [2023-12-02 13:00:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:09,590 INFO L495 AbstractCegarLoop]: Abstraction has 1031 states and 1299 transitions. [2023-12-02 13:00:09,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1299 transitions. [2023-12-02 13:00:09,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 13:00:09,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:09,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:09,594 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:09,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:09,794 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:09,795 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:09,795 INFO L85 PathProgramCache]: Analyzing trace with hash -14134636, now seen corresponding path program 1 times [2023-12-02 13:00:09,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:09,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146716793] [2023-12-02 13:00:09,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:09,796 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-12-02 13:00:09,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:09,797 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:09,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:10,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:00:10,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:10,022 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:10,022 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:10,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146716793] [2023-12-02 13:00:10,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146716793] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:00:10,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907289618] [2023-12-02 13:00:10,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:10,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:10,024 INFO L87 Difference]: Start difference. First operand 1031 states and 1299 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:11,063 INFO L93 Difference]: Finished difference Result 1017 states and 1257 transitions. [2023-12-02 13:00:11,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:11,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 13:00:11,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:11,069 INFO L225 Difference]: With dead ends: 1017 [2023-12-02 13:00:11,069 INFO L226 Difference]: Without dead ends: 1017 [2023-12-02 13:00:11,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:11,070 INFO L413 NwaCegarLoop]: 748 mSDtfsCounter, 58 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2220 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:11,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2220 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-02 13:00:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2023-12-02 13:00:11,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 1015. [2023-12-02 13:00:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 597 states have (on average 2.0519262981574538) internal successors, (1225), 997 states have internal predecessors, (1225), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:00:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1255 transitions. [2023-12-02 13:00:11,091 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1255 transitions. Word has length 17 [2023-12-02 13:00:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:11,091 INFO L495 AbstractCegarLoop]: Abstraction has 1015 states and 1255 transitions. [2023-12-02 13:00:11,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1255 transitions. [2023-12-02 13:00:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:00:11,092 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:11,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:11,096 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:11,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:11,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:11,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash 734266083, now seen corresponding path program 1 times [2023-12-02 13:00:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104785830] [2023-12-02 13:00:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:11,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-12-02 13:00:11,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:11,295 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:11,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:11,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:00:11,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:11,454 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-12-02 13:00:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:11,623 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:11,623 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:11,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [104785830] [2023-12-02 13:00:11,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [104785830] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:11,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:11,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:00:11,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848694066] [2023-12-02 13:00:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:11,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:11,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:11,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:11,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:11,625 INFO L87 Difference]: Start difference. First operand 1015 states and 1255 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:15,866 INFO L93 Difference]: Finished difference Result 1482 states and 1848 transitions. [2023-12-02 13:00:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:15,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 13:00:15,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:15,873 INFO L225 Difference]: With dead ends: 1482 [2023-12-02 13:00:15,873 INFO L226 Difference]: Without dead ends: 1482 [2023-12-02 13:00:15,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:15,874 INFO L413 NwaCegarLoop]: 948 mSDtfsCounter, 523 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 1411 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 1414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:15,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1885 Invalid, 1414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1411 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 13:00:15,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2023-12-02 13:00:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1011. [2023-12-02 13:00:15,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 597 states have (on average 2.0385259631490786) internal successors, (1217), 993 states have internal predecessors, (1217), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:00:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1247 transitions. [2023-12-02 13:00:15,890 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1247 transitions. Word has length 31 [2023-12-02 13:00:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:15,891 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1247 transitions. [2023-12-02 13:00:15,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1247 transitions. [2023-12-02 13:00:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-12-02 13:00:15,892 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:15,892 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:15,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:16,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:16,093 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:16,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:16,093 INFO L85 PathProgramCache]: Analyzing trace with hash 734266082, now seen corresponding path program 1 times [2023-12-02 13:00:16,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:16,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231972361] [2023-12-02 13:00:16,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:16,094 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-12-02 13:00:16,094 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:16,095 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:16,096 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:16,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:00:16,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:16,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 13:00:16,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:16,311 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:16,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231972361] [2023-12-02 13:00:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [231972361] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:16,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:16,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:00:16,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250274205] [2023-12-02 13:00:16,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:16,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:16,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:16,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:16,312 INFO L87 Difference]: Start difference. First operand 1011 states and 1247 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:18,868 INFO L93 Difference]: Finished difference Result 1391 states and 1749 transitions. [2023-12-02 13:00:18,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:18,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-12-02 13:00:18,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:18,878 INFO L225 Difference]: With dead ends: 1391 [2023-12-02 13:00:18,879 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 13:00:18,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:18,880 INFO L413 NwaCegarLoop]: 434 mSDtfsCounter, 754 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:18,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1032 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 13:00:18,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 13:00:18,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1007. [2023-12-02 13:00:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 597 states have (on average 2.0251256281407035) internal successors, (1209), 989 states have internal predecessors, (1209), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:00:18,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1239 transitions. [2023-12-02 13:00:18,900 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1239 transitions. Word has length 31 [2023-12-02 13:00:18,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:18,900 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1239 transitions. [2023-12-02 13:00:18,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:18,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1239 transitions. [2023-12-02 13:00:18,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-02 13:00:18,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:18,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:18,905 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:19,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:19,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:19,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:19,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2030840777, now seen corresponding path program 1 times [2023-12-02 13:00:19,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:19,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258890526] [2023-12-02 13:00:19,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:19,103 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-12-02 13:00:19,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:19,104 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:19,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:19,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:00:19,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:19,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:19,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:19,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258890526] [2023-12-02 13:00:19,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [258890526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:19,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:19,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:00:19,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357047347] [2023-12-02 13:00:19,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:19,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:19,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:19,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:19,414 INFO L87 Difference]: Start difference. First operand 1007 states and 1239 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:20,639 INFO L93 Difference]: Finished difference Result 995 states and 1219 transitions. [2023-12-02 13:00:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-12-02 13:00:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:20,646 INFO L225 Difference]: With dead ends: 995 [2023-12-02 13:00:20,646 INFO L226 Difference]: Without dead ends: 995 [2023-12-02 13:00:20,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-12-02 13:00:20,647 INFO L413 NwaCegarLoop]: 742 mSDtfsCounter, 23 mSDsluCounter, 1464 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2206 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:20,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2206 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 13:00:20,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-12-02 13:00:20,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2023-12-02 13:00:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 585 states have (on average 2.0324786324786324) internal successors, (1189), 977 states have internal predecessors, (1189), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 13:00:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1219 transitions. [2023-12-02 13:00:20,666 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1219 transitions. Word has length 51 [2023-12-02 13:00:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:20,666 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1219 transitions. [2023-12-02 13:00:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1219 transitions. [2023-12-02 13:00:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 13:00:20,668 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:20,668 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] [2023-12-02 13:00:20,674 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-02 13:00:20,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:20,869 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:20,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:20,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890552, now seen corresponding path program 1 times [2023-12-02 13:00:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756039279] [2023-12-02 13:00:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:20,871 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-12-02 13:00:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:20,872 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:20,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:21,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 13:00:21,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:21,245 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-12-02 13:00:21,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2023-12-02 13:00:21,283 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 13:00:21,283 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-12-02 13:00:21,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:21,554 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:21,554 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:21,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756039279] [2023-12-02 13:00:21,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756039279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:21,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:21,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:00:21,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997074837] [2023-12-02 13:00:21,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:21,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:00:21,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:21,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:00:21,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:21,556 INFO L87 Difference]: Start difference. First operand 995 states and 1219 transitions. Second operand has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:24,294 INFO L93 Difference]: Finished difference Result 1813 states and 2222 transitions. [2023-12-02 13:00:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:00:24,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 13:00:24,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:24,305 INFO L225 Difference]: With dead ends: 1813 [2023-12-02 13:00:24,305 INFO L226 Difference]: Without dead ends: 1813 [2023-12-02 13:00:24,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:00:24,306 INFO L413 NwaCegarLoop]: 480 mSDtfsCounter, 713 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:24,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 918 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 789 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 13:00:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-12-02 13:00:24,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1343. [2023-12-02 13:00:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 918 states have (on average 2.02723311546841) internal successors, (1861), 1313 states have internal predecessors, (1861), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 13:00:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1915 transitions. [2023-12-02 13:00:24,329 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1915 transitions. Word has length 55 [2023-12-02 13:00:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:24,329 INFO L495 AbstractCegarLoop]: Abstraction has 1343 states and 1915 transitions. [2023-12-02 13:00:24,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1915 transitions. [2023-12-02 13:00:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 13:00:24,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:24,330 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] [2023-12-02 13:00:24,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:24,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:24,531 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:24,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:24,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1551890553, now seen corresponding path program 1 times [2023-12-02 13:00:24,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:24,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600855414] [2023-12-02 13:00:24,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:24,532 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-12-02 13:00:24,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:24,533 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:24,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:24,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:00:24,905 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:24,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:00:24,929 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-12-02 13:00:25,001 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-12-02 13:00:25,002 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 14 [2023-12-02 13:00:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:25,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:25,613 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:25,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600855414] [2023-12-02 13:00:25,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600855414] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:25,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:25,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:00:25,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970649334] [2023-12-02 13:00:25,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:25,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:00:25,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:25,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:00:25,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:25,615 INFO L87 Difference]: Start difference. First operand 1343 states and 1915 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:28,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:28,570 INFO L93 Difference]: Finished difference Result 1348 states and 1921 transitions. [2023-12-02 13:00:28,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:00:28,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 13:00:28,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:28,576 INFO L225 Difference]: With dead ends: 1348 [2023-12-02 13:00:28,576 INFO L226 Difference]: Without dead ends: 1348 [2023-12-02 13:00:28,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:00:28,577 INFO L413 NwaCegarLoop]: 747 mSDtfsCounter, 0 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:28,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1544 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-12-02 13:00:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2023-12-02 13:00:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1348. [2023-12-02 13:00:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 922 states have (on average 2.022776572668113) internal successors, (1865), 1317 states have internal predecessors, (1865), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-02 13:00:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1921 transitions. [2023-12-02 13:00:28,597 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1921 transitions. Word has length 55 [2023-12-02 13:00:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:28,597 INFO L495 AbstractCegarLoop]: Abstraction has 1348 states and 1921 transitions. [2023-12-02 13:00:28,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:28,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1921 transitions. [2023-12-02 13:00:28,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 13:00:28,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:28,598 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-12-02 13:00:28,604 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-02 13:00:28,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:28,799 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:28,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:28,799 INFO L85 PathProgramCache]: Analyzing trace with hash 298511460, now seen corresponding path program 1 times [2023-12-02 13:00:28,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:28,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [562788026] [2023-12-02 13:00:28,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:28,800 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-12-02 13:00:28,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:28,801 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:28,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:29,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:00:29,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:29,215 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:29,215 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:29,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [562788026] [2023-12-02 13:00:29,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [562788026] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:29,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:29,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:00:29,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250068701] [2023-12-02 13:00:29,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:29,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:00:29,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:29,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:00:29,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:00:29,218 INFO L87 Difference]: Start difference. First operand 1348 states and 1921 transitions. Second operand has 6 states, 6 states have (on average 9.5) 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-12-02 13:00:30,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:30,868 INFO L93 Difference]: Finished difference Result 1352 states and 1929 transitions. [2023-12-02 13:00:30,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:00:30,870 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) 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-12-02 13:00:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:30,877 INFO L225 Difference]: With dead ends: 1352 [2023-12-02 13:00:30,878 INFO L226 Difference]: Without dead ends: 1352 [2023-12-02 13:00:30,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:00:30,878 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 19 mSDsluCounter, 2158 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2897 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:30,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2897 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 13:00:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2023-12-02 13:00:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1350. [2023-12-02 13:00:30,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1350 states, 923 states have (on average 2.021668472372698) internal successors, (1866), 1318 states have internal predecessors, (1866), 30 states have call successors, (30), 10 states have call predecessors, (30), 8 states have return successors, (29), 22 states have call predecessors, (29), 26 states have call successors, (29) [2023-12-02 13:00:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 1925 transitions. [2023-12-02 13:00:30,910 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 1925 transitions. Word has length 59 [2023-12-02 13:00:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:30,911 INFO L495 AbstractCegarLoop]: Abstraction has 1350 states and 1925 transitions. [2023-12-02 13:00:30,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) 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-12-02 13:00:30,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 1925 transitions. [2023-12-02 13:00:30,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-12-02 13:00:30,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:30,911 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:30,916 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:31,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:31,112 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:31,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1320167083, now seen corresponding path program 1 times [2023-12-02 13:00:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:31,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589383269] [2023-12-02 13:00:31,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:31,113 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-12-02 13:00:31,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:31,114 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:31,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:31,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:00:31,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:31,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:31,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:31,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589383269] [2023-12-02 13:00:31,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589383269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:31,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:31,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:00:31,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192502995] [2023-12-02 13:00:31,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:31,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:00:31,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:31,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:00:31,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-02 13:00:31,414 INFO L87 Difference]: Start difference. First operand 1350 states and 1925 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:32,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:32,857 INFO L93 Difference]: Finished difference Result 1374 states and 1949 transitions. [2023-12-02 13:00:32,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:00:32,860 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-12-02 13:00:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:32,867 INFO L225 Difference]: With dead ends: 1374 [2023-12-02 13:00:32,867 INFO L226 Difference]: Without dead ends: 1374 [2023-12-02 13:00:32,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:00:32,868 INFO L413 NwaCegarLoop]: 754 mSDtfsCounter, 16 mSDsluCounter, 3009 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3763 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:32,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3763 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 13:00:32,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2023-12-02 13:00:32,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1370. [2023-12-02 13:00:32,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1370 states, 937 states have (on average 2.0117395944503733) internal successors, (1885), 1334 states have internal predecessors, (1885), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 13:00:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1370 states to 1370 states and 1946 transitions. [2023-12-02 13:00:32,894 INFO L78 Accepts]: Start accepts. Automaton has 1370 states and 1946 transitions. Word has length 62 [2023-12-02 13:00:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:32,894 INFO L495 AbstractCegarLoop]: Abstraction has 1370 states and 1946 transitions. [2023-12-02 13:00:32,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:00:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1370 states and 1946 transitions. [2023-12-02 13:00:32,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 13:00:32,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:32,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:32,900 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:33,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:33,096 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:33,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192545, now seen corresponding path program 1 times [2023-12-02 13:00:33,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:33,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138026820] [2023-12-02 13:00:33,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:33,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:00:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:33,098 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:33,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:33,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:00:33,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:33,488 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-12-02 13:00:33,622 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2023-12-02 13:00:33,637 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-12-02 13:00:33,637 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-12-02 13:00:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:33,647 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:33,647 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:33,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138026820] [2023-12-02 13:00:33,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138026820] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:33,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:33,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:00:33,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900776913] [2023-12-02 13:00:33,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:33,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:00:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:33,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:00:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 13:00:33,649 INFO L87 Difference]: Start difference. First operand 1370 states and 1946 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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-12-02 13:00:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:36,528 INFO L93 Difference]: Finished difference Result 1753 states and 2454 transitions. [2023-12-02 13:00:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:00:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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 64 [2023-12-02 13:00:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:36,535 INFO L225 Difference]: With dead ends: 1753 [2023-12-02 13:00:36,535 INFO L226 Difference]: Without dead ends: 1753 [2023-12-02 13:00:36,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-12-02 13:00:36,536 INFO L413 NwaCegarLoop]: 405 mSDtfsCounter, 723 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1207 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:36,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 977 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1113 Invalid, 0 Unknown, 1207 Unchecked, 2.8s Time] [2023-12-02 13:00:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2023-12-02 13:00:36,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1369. [2023-12-02 13:00:36,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 937 states have (on average 2.0096051227321237) internal successors, (1883), 1333 states have internal predecessors, (1883), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 13:00:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1944 transitions. [2023-12-02 13:00:36,556 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1944 transitions. Word has length 64 [2023-12-02 13:00:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:36,556 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 1944 transitions. [2023-12-02 13:00:36,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 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-12-02 13:00:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1944 transitions. [2023-12-02 13:00:36,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-12-02 13:00:36,557 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:36,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:36,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:36,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:36,758 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:36,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1559192544, now seen corresponding path program 1 times [2023-12-02 13:00:36,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:36,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688400262] [2023-12-02 13:00:36,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:36,759 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-12-02 13:00:36,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:36,760 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:36,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:37,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:37,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 13:00:37,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:37,144 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-12-02 13:00:37,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 13:00:37,613 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2023-12-02 13:00:37,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:00:37,636 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-12-02 13:00:37,651 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:00:37,652 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-12-02 13:00:37,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:37,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:37,666 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:37,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688400262] [2023-12-02 13:00:37,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688400262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:37,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:37,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:00:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211090756] [2023-12-02 13:00:37,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:37,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 13:00:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:37,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 13:00:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 13:00:37,668 INFO L87 Difference]: Start difference. First operand 1369 states and 1944 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-12-02 13:00:44,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:44,034 INFO L93 Difference]: Finished difference Result 2312 states and 3241 transitions. [2023-12-02 13:00:44,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:00:44,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 64 [2023-12-02 13:00:44,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:44,045 INFO L225 Difference]: With dead ends: 2312 [2023-12-02 13:00:44,045 INFO L226 Difference]: Without dead ends: 2312 [2023-12-02 13:00:44,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-12-02 13:00:44,046 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 835 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 2639 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 4281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1617 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:44,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1657 Invalid, 4281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2639 Invalid, 0 Unknown, 1617 Unchecked, 6.3s Time] [2023-12-02 13:00:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2312 states. [2023-12-02 13:00:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2312 to 1365. [2023-12-02 13:00:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 941 states have (on average 1.9883103081827842) internal successors, (1871), 1329 states have internal predecessors, (1871), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 13:00:44,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1932 transitions. [2023-12-02 13:00:44,072 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1932 transitions. Word has length 64 [2023-12-02 13:00:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:44,072 INFO L495 AbstractCegarLoop]: Abstraction has 1365 states and 1932 transitions. [2023-12-02 13:00:44,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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-12-02 13:00:44,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1932 transitions. [2023-12-02 13:00:44,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 13:00:44,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:44,072 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:44,080 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:44,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:44,273 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:44,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:44,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1110857919, now seen corresponding path program 1 times [2023-12-02 13:00:44,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:44,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [968494700] [2023-12-02 13:00:44,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 13:00:44,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:44,275 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:44,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-02 13:00:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:44,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-02 13:00:44,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:44,584 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-12-02 13:00:44,608 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-12-02 13:00:44,631 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-12-02 13:00:44,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:44,671 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:44,672 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:44,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [968494700] [2023-12-02 13:00:44,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [968494700] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:44,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:44,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:00:44,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148723352] [2023-12-02 13:00:44,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:44,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:00:44,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:44,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:00:44,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:00:44,673 INFO L87 Difference]: Start difference. First operand 1365 states and 1932 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 13:00:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:49,262 INFO L93 Difference]: Finished difference Result 1376 states and 1944 transitions. [2023-12-02 13:00:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:00:49,263 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-12-02 13:00:49,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:49,266 INFO L225 Difference]: With dead ends: 1376 [2023-12-02 13:00:49,266 INFO L226 Difference]: Without dead ends: 1376 [2023-12-02 13:00:49,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:00:49,266 INFO L413 NwaCegarLoop]: 741 mSDtfsCounter, 14 mSDsluCounter, 2515 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:49,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3256 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2625 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 13:00:49,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2023-12-02 13:00:49,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1375. [2023-12-02 13:00:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.9841938883034773) internal successors, (1883), 1337 states have internal predecessors, (1883), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 13:00:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1944 transitions. [2023-12-02 13:00:49,288 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1944 transitions. Word has length 70 [2023-12-02 13:00:49,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:49,288 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1944 transitions. [2023-12-02 13:00:49,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 13:00:49,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1944 transitions. [2023-12-02 13:00:49,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-12-02 13:00:49,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:49,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:49,297 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-02 13:00:49,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:49,490 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:49,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash 76857197, now seen corresponding path program 1 times [2023-12-02 13:00:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538854444] [2023-12-02 13:00:49,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:49,492 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-12-02 13:00:49,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:49,493 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:49,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:49,819 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-02 13:00:49,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:49,841 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-12-02 13:00:49,880 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-12-02 13:00:49,893 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-12-02 13:00:49,940 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-12-02 13:00:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:50,039 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:50,039 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:50,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538854444] [2023-12-02 13:00:50,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538854444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:50,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:50,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:00:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268429828] [2023-12-02 13:00:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:50,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:00:50,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:50,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:00:50,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:00:50,041 INFO L87 Difference]: Start difference. First operand 1375 states and 1944 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:00:56,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:56,685 INFO L93 Difference]: Finished difference Result 1375 states and 1942 transitions. [2023-12-02 13:00:56,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 13:00:56,686 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2023-12-02 13:00:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:56,690 INFO L225 Difference]: With dead ends: 1375 [2023-12-02 13:00:56,690 INFO L226 Difference]: Without dead ends: 1375 [2023-12-02 13:00:56,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:00:56,691 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 12 mSDsluCounter, 3089 mSDsCounter, 0 mSdLazyCounter, 2891 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 3828 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:56,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 3828 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2891 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-02 13:00:56,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2023-12-02 13:00:56,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2023-12-02 13:00:56,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 949 states have (on average 1.982086406743941) internal successors, (1881), 1337 states have internal predecessors, (1881), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2023-12-02 13:00:56,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1942 transitions. [2023-12-02 13:00:56,711 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1942 transitions. Word has length 71 [2023-12-02 13:00:56,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:56,711 INFO L495 AbstractCegarLoop]: Abstraction has 1375 states and 1942 transitions. [2023-12-02 13:00:56,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 13:00:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1942 transitions. [2023-12-02 13:00:56,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 13:00:56,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:56,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:56,717 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:56,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:56,912 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:56,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash -998618493, now seen corresponding path program 1 times [2023-12-02 13:00:56,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:56,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346351019] [2023-12-02 13:00:56,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:56,914 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-12-02 13:00:56,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:56,915 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:56,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-02 13:00:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:57,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 13:00:57,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:57,272 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 13:00:57,272 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346351019] [2023-12-02 13:00:57,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346351019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:00:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:00:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:00:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125876571] [2023-12-02 13:00:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:00:57,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:00:57,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:00:57,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:00:57,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:57,274 INFO L87 Difference]: Start difference. First operand 1375 states and 1942 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 13:00:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:00:58,718 INFO L93 Difference]: Finished difference Result 1383 states and 1952 transitions. [2023-12-02 13:00:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:00:58,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2023-12-02 13:00:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:00:58,723 INFO L225 Difference]: With dead ends: 1383 [2023-12-02 13:00:58,723 INFO L226 Difference]: Without dead ends: 1381 [2023-12-02 13:00:58,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:00:58,724 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 4 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:00:58,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2966 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 13:00:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2023-12-02 13:00:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1381. [2023-12-02 13:00:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 953 states have (on average 1.9800629590766001) internal successors, (1887), 1343 states have internal predecessors, (1887), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 13:00:58,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1950 transitions. [2023-12-02 13:00:58,748 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1950 transitions. Word has length 76 [2023-12-02 13:00:58,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:00:58,748 INFO L495 AbstractCegarLoop]: Abstraction has 1381 states and 1950 transitions. [2023-12-02 13:00:58,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 13:00:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1950 transitions. [2023-12-02 13:00:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-12-02 13:00:58,750 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:00:58,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:00:58,756 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-02 13:00:58,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:58,954 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:00:58,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:00:58,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2135152941, now seen corresponding path program 1 times [2023-12-02 13:00:58,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:00:58,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835061968] [2023-12-02 13:00:58,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:58,956 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-12-02 13:00:58,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:00:58,957 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:58,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:00:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:59,279 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:00:59,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:00:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:59,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:00:59,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:00:59,435 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:00:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835061968] [2023-12-02 13:00:59,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835061968] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:00:59,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [277042448] [2023-12-02 13:00:59,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:00:59,435 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:00:59,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:00:59,436 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:00:59,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 13:00:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:00:59,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:00:59,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:00,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:00,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [277042448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:01:00,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669420102] [2023-12-02 13:01:00,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:01:00,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:00,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:00,080 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:00,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 13:01:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:01:00,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:01:00,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:00,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669420102] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:01:00,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:01:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6, 6, 6] total 10 [2023-12-02 13:01:00,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267145226] [2023-12-02 13:01:00,486 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:00,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 13:01:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:01:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 13:01:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:01:00,489 INFO L87 Difference]: Start difference. First operand 1381 states and 1950 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 13:01:02,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:01:02,728 INFO L93 Difference]: Finished difference Result 1395 states and 1968 transitions. [2023-12-02 13:01:02,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:01:02,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-12-02 13:01:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:01:02,734 INFO L225 Difference]: With dead ends: 1395 [2023-12-02 13:01:02,734 INFO L226 Difference]: Without dead ends: 1391 [2023-12-02 13:01:02,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 448 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:01:02,735 INFO L413 NwaCegarLoop]: 745 mSDtfsCounter, 14 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5185 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:01:02,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5185 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-02 13:01:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2023-12-02 13:01:02,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 1389. [2023-12-02 13:01:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 961 states have (on average 1.9739854318418315) internal successors, (1897), 1351 states have internal predecessors, (1897), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 13:01:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1960 transitions. [2023-12-02 13:01:02,752 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1960 transitions. Word has length 77 [2023-12-02 13:01:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:01:02,752 INFO L495 AbstractCegarLoop]: Abstraction has 1389 states and 1960 transitions. [2023-12-02 13:01:02,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-02 13:01:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1960 transitions. [2023-12-02 13:01:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-12-02 13:01:02,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:01:02,753 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:01:02,763 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 13:01:02,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-12-02 13:01:03,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:01:03,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:01:03,354 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:01:03,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:01:03,355 INFO L85 PathProgramCache]: Analyzing trace with hash -239229693, now seen corresponding path program 2 times [2023-12-02 13:01:03,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:01:03,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601046486] [2023-12-02 13:01:03,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:01:03,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-12-02 13:01:03,356 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:01:03,356 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:01:03,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-02 13:01:03,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:01:03,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:01:03,961 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:01:03,963 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:04,072 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:04,443 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:01:04,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601046486] [2023-12-02 13:01:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601046486] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:01:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [440807811] [2023-12-02 13:01:04,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:01:04,444 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:01:04,444 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:01:04,445 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:01:04,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 13:01:06,526 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:01:06,526 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:01:06,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 13:01:06,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:06,585 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:06,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:01:06,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [440807811] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:01:06,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17276747] [2023-12-02 13:01:06,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:01:06,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:01:06,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:01:06,660 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:01:06,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 13:01:51,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:01:51,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:01:51,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-02 13:01:51,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:01:51,259 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:01:51,259 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-12-02 13:01:51,296 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-12-02 13:01:51,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:01:51,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 13:01:51,829 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-12-02 13:01:51,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:01:51,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:01:52,035 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:01:52,036 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-12-02 13:01:52,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2335 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2335) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 13:01:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17276747] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:01:52,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:01:52,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9, 9, 14] total 29 [2023-12-02 13:01:52,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196802852] [2023-12-02 13:01:52,047 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:01:52,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 13:01:52,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:01:52,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 13:01:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=756, Unknown=1, NotChecked=56, Total=930 [2023-12-02 13:01:52,049 INFO L87 Difference]: Start difference. First operand 1389 states and 1960 transitions. Second operand has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:02:09,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:02:09,518 INFO L93 Difference]: Finished difference Result 1798 states and 2508 transitions. [2023-12-02 13:02:09,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 13:02:09,519 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80 [2023-12-02 13:02:09,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:02:09,521 INFO L225 Difference]: With dead ends: 1798 [2023-12-02 13:02:09,521 INFO L226 Difference]: Without dead ends: 1794 [2023-12-02 13:02:09,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=619, Invalid=3166, Unknown=1, NotChecked=120, Total=3906 [2023-12-02 13:02:09,523 INFO L413 NwaCegarLoop]: 395 mSDtfsCounter, 795 mSDsluCounter, 6538 mSDsCounter, 0 mSdLazyCounter, 8778 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 6933 SdHoareTripleChecker+Invalid, 8839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 8778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:02:09,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 6933 Invalid, 8839 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [61 Valid, 8778 Invalid, 0 Unknown, 0 Unchecked, 15.9s Time] [2023-12-02 13:02:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1794 states. [2023-12-02 13:02:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1794 to 1406. [2023-12-02 13:02:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1406 states, 979 states have (on average 1.9601634320735444) internal successors, (1919), 1368 states have internal predecessors, (1919), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 13:02:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1406 states to 1406 states and 1982 transitions. [2023-12-02 13:02:09,537 INFO L78 Accepts]: Start accepts. Automaton has 1406 states and 1982 transitions. Word has length 80 [2023-12-02 13:02:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:02:09,537 INFO L495 AbstractCegarLoop]: Abstraction has 1406 states and 1982 transitions. [2023-12-02 13:02:09,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 5.84) internal successors, (146), 27 states have internal predecessors, (146), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:02:09,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1406 states and 1982 transitions. [2023-12-02 13:02:09,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-02 13:02:09,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:02:09,538 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:02:09,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 13:02:09,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-12-02 13:02:09,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-12-02 13:02:10,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:02:10,139 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:02:10,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:02:10,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1517835460, now seen corresponding path program 1 times [2023-12-02 13:02:10,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:02:10,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [95237349] [2023-12-02 13:02:10,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:10,141 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-12-02 13:02:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:02:10,142 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:02:10,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:02:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:10,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 13:02:10,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:10,786 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:10,786 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:11,629 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:02:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [95237349] [2023-12-02 13:02:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [95237349] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:02:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [418615675] [2023-12-02 13:02:11,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:11,629 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:02:11,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:02:11,630 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:02:11,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 13:02:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:12,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-02 13:02:12,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:12,444 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:12,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:12,636 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [418615675] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:02:12,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76473742] [2023-12-02 13:02:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:02:12,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:12,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:02:12,638 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:02:12,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 13:02:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:02:13,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 13:02:13,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:13,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76473742] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:02:14,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 13:02:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15, 15, 15, 15] total 41 [2023-12-02 13:02:14,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301057729] [2023-12-02 13:02:14,847 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 13:02:14,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-02 13:02:14,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:02:14,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-02 13:02:14,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1187, Unknown=0, NotChecked=0, Total=1640 [2023-12-02 13:02:14,850 INFO L87 Difference]: Start difference. First operand 1406 states and 1982 transitions. Second operand has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 13:02:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:02:24,565 INFO L93 Difference]: Finished difference Result 1450 states and 2056 transitions. [2023-12-02 13:02:24,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-12-02 13:02:24,566 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2023-12-02 13:02:24,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:02:24,577 INFO L225 Difference]: With dead ends: 1450 [2023-12-02 13:02:24,577 INFO L226 Difference]: Without dead ends: 1444 [2023-12-02 13:02:24,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 471 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1295, Invalid=2737, Unknown=0, NotChecked=0, Total=4032 [2023-12-02 13:02:24,579 INFO L413 NwaCegarLoop]: 744 mSDtfsCounter, 75 mSDsluCounter, 11097 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 11841 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:02:24,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 11841 Invalid, 2127 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-02 13:02:24,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2023-12-02 13:02:24,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1442. [2023-12-02 13:02:24,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1015 states have (on average 1.935960591133005) internal successors, (1965), 1404 states have internal predecessors, (1965), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 13:02:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 2028 transitions. [2023-12-02 13:02:24,598 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 2028 transitions. Word has length 86 [2023-12-02 13:02:24,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:02:24,598 INFO L495 AbstractCegarLoop]: Abstraction has 1442 states and 2028 transitions. [2023-12-02 13:02:24,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 2.8684210526315788) internal successors, (109), 41 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-02 13:02:24,598 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 2028 transitions. [2023-12-02 13:02:24,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-02 13:02:24,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:02:24,599 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:02:24,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 13:02:24,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 13:02:25,006 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:02:25,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:02:25,200 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:02:25,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:02:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1951482948, now seen corresponding path program 2 times [2023-12-02 13:02:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:02:25,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515520983] [2023-12-02 13:02:25,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:02:25,202 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-12-02 13:02:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:02:25,203 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:02:25,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-12-02 13:02:26,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:02:26,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:02:26,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 13:02:26,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:26,764 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:26,764 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:29,271 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:02:29,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515520983] [2023-12-02 13:02:29,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515520983] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:02:29,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [110486531] [2023-12-02 13:02:29,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:02:29,272 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:02:29,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:02:29,273 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:02:29,273 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 13:02:31,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:02:31,966 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:02:32,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-02 13:02:32,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:02:32,134 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:32,134 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:02:32,508 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:02:32,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [110486531] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:02:32,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869398689] [2023-12-02 13:02:32,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 13:02:32,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:02:32,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:02:32,510 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:02:32,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 13:03:38,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 13:03:38,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:03:38,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 72 conjunts are in the unsatisfiable core [2023-12-02 13:03:38,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:03:38,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:03:38,559 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:03:38,559 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-12-02 13:03:38,668 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-12-02 13:03:38,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 13:03:39,026 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-12-02 13:03:39,031 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-12-02 13:03:40,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:03:40,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:03:40,188 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-12-02 13:03:40,404 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-12-02 13:03:40,410 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-12-02 13:03:40,517 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2023-12-02 13:03:40,517 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:03:41,594 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3733 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3733) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_3732 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3732) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 13:03:41,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869398689] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:03:41,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 13:03:41,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27, 27, 13] total 64 [2023-12-02 13:03:41,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110353694] [2023-12-02 13:03:41,603 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 13:03:41,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-02 13:03:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:03:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-02 13:03:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=765, Invalid=3528, Unknown=1, NotChecked=128, Total=4422 [2023-12-02 13:03:41,606 INFO L87 Difference]: Start difference. First operand 1442 states and 2028 transitions. Second operand has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:04:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:04:39,631 INFO L93 Difference]: Finished difference Result 1899 states and 2674 transitions. [2023-12-02 13:04:39,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-12-02 13:04:39,632 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 98 [2023-12-02 13:04:39,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:04:39,635 INFO L225 Difference]: With dead ends: 1899 [2023-12-02 13:04:39,635 INFO L226 Difference]: Without dead ends: 1895 [2023-12-02 13:04:39,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 425 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4790 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=3579, Invalid=17304, Unknown=1, NotChecked=286, Total=21170 [2023-12-02 13:04:39,642 INFO L413 NwaCegarLoop]: 404 mSDtfsCounter, 922 mSDsluCounter, 11912 mSDsCounter, 0 mSdLazyCounter, 18946 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 12316 SdHoareTripleChecker+Invalid, 19001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2023-12-02 13:04:39,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 12316 Invalid, 19001 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [55 Valid, 18946 Invalid, 0 Unknown, 0 Unchecked, 42.7s Time] [2023-12-02 13:04:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2023-12-02 13:04:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1509. [2023-12-02 13:04:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1083 states have (on average 1.8975069252077563) internal successors, (2055), 1471 states have internal predecessors, (2055), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 13:04:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2118 transitions. [2023-12-02 13:04:39,662 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2118 transitions. Word has length 98 [2023-12-02 13:04:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:04:39,662 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2118 transitions. [2023-12-02 13:04:39,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 60 states have (on average 3.033333333333333) internal successors, (182), 61 states have internal predecessors, (182), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-02 13:04:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2118 transitions. [2023-12-02 13:04:39,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 13:04:39,663 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:04:39,663 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:04:39,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 13:04:39,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Ended with exit code 0 [2023-12-02 13:04:40,103 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 13:04:40,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:04:40,264 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:04:40,265 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:04:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash -769932828, now seen corresponding path program 1 times [2023-12-02 13:04:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:04:40,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117884930] [2023-12-02 13:04:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:04:40,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-12-02 13:04:40,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:04:40,267 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:04:40,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:04:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:04:41,213 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 13:04:41,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:04:41,228 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-12-02 13:04:41,384 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:04:41,385 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-12-02 13:04:41,425 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-12-02 13:04:41,526 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-12-02 13:04:42,737 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:42,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 13:04:42,868 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:42,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 13:04:42,886 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-12-02 13:04:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:04:42,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:04:45,094 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4172) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:04:45,584 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4218 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4218))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4172)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 13:04:45,586 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:04:45,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117884930] [2023-12-02 13:04:45,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117884930] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:04:45,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [409898950] [2023-12-02 13:04:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:04:45,587 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:04:45,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:04:45,588 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:04:45,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 13:04:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:04:49,590 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 13:04:49,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:04:49,606 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-12-02 13:04:49,985 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:04:49,985 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-12-02 13:04:50,038 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-12-02 13:04:50,844 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:04:50,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2023-12-02 13:04:50,951 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:04:50,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:04:51,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 13:04:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:04:51,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:04:51,067 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:04:51,068 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-12-02 13:04:51,084 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem74#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4656) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) is different from false [2023-12-02 13:04:51,095 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_4656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 13:04:51,576 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4656 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4702 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4702)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_4656) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 13:04:51,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [409898950] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:04:51,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066177285] [2023-12-02 13:04:51,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:04:51,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:04:51,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:04:51,581 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:04:51,581 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 13:04:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:04:52,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:04:52,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:04:52,259 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-12-02 13:04:52,400 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:04:52,401 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-12-02 13:04:52,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 13:04:53,471 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:53,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-12-02 13:04:53,667 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:04:53,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:04:53,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 33 treesize of output 15 [2023-12-02 13:04:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:04:53,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:04:56,288 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 13:04:56,288 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-12-02 13:04:56,301 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4172 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5186 (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$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5186))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4172)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem73#1.base|)) is different from false [2023-12-02 13:04:56,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066177285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:04:56,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:04:56,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 33 [2023-12-02 13:04:56,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427934526] [2023-12-02 13:04:56,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:04:56,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 13:04:56,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:04:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 13:04:56,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1121, Unknown=13, NotChecked=438, Total=1722 [2023-12-02 13:04:56,306 INFO L87 Difference]: Start difference. First operand 1509 states and 2118 transitions. Second operand has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:05:07,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:05:07,814 INFO L93 Difference]: Finished difference Result 1892 states and 2624 transitions. [2023-12-02 13:05:07,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:05:07,814 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 122 [2023-12-02 13:05:07,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:05:07,818 INFO L225 Difference]: With dead ends: 1892 [2023-12-02 13:05:07,819 INFO L226 Difference]: Without dead ends: 1892 [2023-12-02 13:05:07,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 340 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=312, Invalid=2249, Unknown=13, NotChecked=618, Total=3192 [2023-12-02 13:05:07,820 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 1433 mSDsluCounter, 3802 mSDsCounter, 0 mSdLazyCounter, 5603 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 4184 SdHoareTripleChecker+Invalid, 5678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 5603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:05:07,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 4184 Invalid, 5678 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [75 Valid, 5603 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2023-12-02 13:05:07,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2023-12-02 13:05:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1506. [2023-12-02 13:05:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1083 states have (on average 1.89196675900277) internal successors, (2049), 1468 states have internal predecessors, (2049), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2023-12-02 13:05:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2112 transitions. [2023-12-02 13:05:07,854 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2112 transitions. Word has length 122 [2023-12-02 13:05:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:05:07,854 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 2112 transitions. [2023-12-02 13:05:07,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 5.535714285714286) internal successors, (155), 29 states have internal predecessors, (155), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:05:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2112 transitions. [2023-12-02 13:05:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-02 13:05:07,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:05:07,856 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:05:07,874 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-12-02 13:05:08,067 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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)] Forceful destruction successful, exit code 0 [2023-12-02 13:05:08,273 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 13:05:08,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:05:08,457 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:05:08,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:05:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash -769932827, now seen corresponding path program 1 times [2023-12-02 13:05:08,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:05:08,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740690340] [2023-12-02 13:05:08,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:05:08,458 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-12-02 13:05:08,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:05:08,459 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:05:08,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2023-12-02 13:05:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:05:09,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 123 conjunts are in the unsatisfiable core [2023-12-02 13:05:09,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:05:09,366 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-12-02 13:05:09,653 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-12-02 13:05:09,697 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:05:09,697 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-12-02 13:05:09,743 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-12-02 13:05:09,748 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-12-02 13:05:09,900 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-12-02 13:05:09,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-12-02 13:05:11,076 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:05:11,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:05:11,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 13:05:11,239 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:05:11,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 13:05:11,246 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-12-02 13:05:11,271 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-12-02 13:05:11,279 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-12-02 13:05:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:05:11,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:05:11,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 13:05:11,611 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 13:05:13,297 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5764) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5763) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5763 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5764 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5671 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5672 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5763))) (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$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5764) .cse2 v_ArrVal_5672) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5671) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:05:13,308 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:05:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740690340] [2023-12-02 13:05:13,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740690340] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:05:13,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720340599] [2023-12-02 13:05:13,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:05:13,308 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:05:13,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:05:13,309 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:05:13,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 13:05:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:05:17,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 81 conjunts are in the unsatisfiable core [2023-12-02 13:05:17,891 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:05:17,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:05:17,907 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-12-02 13:05:18,605 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:05:18,605 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-12-02 13:05:18,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-12-02 13:05:18,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 13:05:18,684 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-12-02 13:05:18,788 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 16 treesize of output 8 [2023-12-02 13:05:18,851 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 7 treesize of output 3 [2023-12-02 13:05:19,617 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 16 treesize of output 11 [2023-12-02 13:05:19,896 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2023-12-02 13:05:19,904 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 27 treesize of output 22 [2023-12-02 13:05:20,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-12-02 13:05:20,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:05:20,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2023-12-02 13:05:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:05:20,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:05:20,669 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 239 treesize of output 167 [2023-12-02 13:05:27,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (forall ((v_arrayElimCell_74 (_ BitVec 32))) (let ((.cse3 (select |c_#length| v_arrayElimCell_74))) (or (bvule (bvadd (select (select (store .cse0 v_arrayElimCell_74 (store (select .cse0 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse1) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse3) (not (bvule (bvadd .cse1 (_ bv20 32)) .cse3))))) (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse1)))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_74 (store (select .cse5 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse6) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv4 32)) (bvadd .cse4 (_ bv8 32)))) (not (bvule (bvadd .cse6 (_ bv20 32)) (select |c_#length| v_arrayElimCell_74))))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse9 (select |c_#length| v_arrayElimCell_74))) (or (bvule (bvadd (select (select (store .cse7 v_arrayElimCell_74 (store (select .cse7 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse8) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse9) (not (bvule (bvadd .cse8 (_ bv20 32)) .cse9)) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_74))))) (forall ((v_arrayElimCell_74 (_ BitVec 32)) (v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse10 (bvadd (select (select (store .cse13 v_arrayElimCell_74 (store (select .cse13 v_arrayElimCell_74) (bvadd (_ bv16 32) .cse12) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32))) (.cse11 (select |c_#length| v_arrayElimCell_74))) (or (bvule .cse10 .cse11) (forall ((v_ArrVal_6207 (_ BitVec 32))) (bvule .cse10 (select |c_#length| v_ArrVal_6207))) (not (bvule (bvadd .cse12 (_ bv20 32)) .cse11))))))) (forall ((v_ArrVal_6254 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6254) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse14 (select .cse15 .cse2))) (or (not (= |c_ULTIMATE.start_main_~user~0#1.offset| (bvadd (_ bv8 32) .cse14))) (forall ((v_ArrVal_6207 (_ BitVec 32))) (bvule (bvadd (select (store .cse15 (bvadd (_ bv16 32) .cse14) .cse2) .cse2) (_ bv8 32)) (select |c_#length| v_ArrVal_6207))) (not (bvule (bvadd .cse14 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))))))))) is different from false [2023-12-02 13:05:27,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [720340599] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:05:27,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658541799] [2023-12-02 13:05:27,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:05:27,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:05:27,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:05:27,741 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:05:27,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 13:05:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:05:28,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 13:05:28,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:05:28,773 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-12-02 13:05:28,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:05:28,799 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-12-02 13:05:28,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 13:05:28,956 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-12-02 13:05:29,305 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-12-02 13:05:29,310 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-12-02 13:05:30,431 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:05:30,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:05:30,439 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-12-02 13:05:30,910 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:05:30,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-12-02 13:05:30,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 13:05:30,946 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-12-02 13:05:30,957 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-12-02 13:05:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:05:30,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:05:31,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_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv4 32) .cse1) (bvadd (_ bv8 32) .cse1)))))) is different from false [2023-12-02 13:05:31,081 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-12-02 13:05:32,797 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6830))) (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$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6831) .cse0 v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6831) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6830) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 13:05:32,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658541799] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:05:32,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:05:32,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 33 [2023-12-02 13:05:32,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251974881] [2023-12-02 13:05:32,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:05:32,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 13:05:32,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:05:32,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 13:05:32,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1291, Unknown=7, NotChecked=546, Total=1980 [2023-12-02 13:05:32,812 INFO L87 Difference]: Start difference. First operand 1506 states and 2112 transitions. Second operand has 34 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 13:06:30,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:06:30,085 INFO L93 Difference]: Finished difference Result 2432 states and 3362 transitions. [2023-12-02 13:06:30,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 13:06:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 122 [2023-12-02 13:06:30,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:06:30,090 INFO L225 Difference]: With dead ends: 2432 [2023-12-02 13:06:30,090 INFO L226 Difference]: Without dead ends: 2432 [2023-12-02 13:06:30,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 335 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=278, Invalid=2395, Unknown=7, NotChecked=742, Total=3422 [2023-12-02 13:06:30,092 INFO L413 NwaCegarLoop]: 495 mSDtfsCounter, 1164 mSDsluCounter, 7022 mSDsCounter, 0 mSdLazyCounter, 20892 mSolverCounterSat, 37 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1166 SdHoareTripleChecker+Valid, 7517 SdHoareTripleChecker+Invalid, 20936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 20892 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:06:30,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1166 Valid, 7517 Invalid, 20936 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [37 Valid, 20892 Invalid, 7 Unknown, 0 Unchecked, 54.9s Time] [2023-12-02 13:06:30,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2023-12-02 13:06:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1720. [2023-12-02 13:06:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1295 states have (on average 1.9073359073359073) internal successors, (2470), 1680 states have internal predecessors, (2470), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 13:06:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2537 transitions. [2023-12-02 13:06:30,122 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2537 transitions. Word has length 122 [2023-12-02 13:06:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:06:30,122 INFO L495 AbstractCegarLoop]: Abstraction has 1720 states and 2537 transitions. [2023-12-02 13:06:30,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 28 states have (on average 7.178571428571429) internal successors, (201), 28 states have internal predecessors, (201), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-02 13:06:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2537 transitions. [2023-12-02 13:06:30,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 13:06:30,123 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:06:30,123 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:06:30,136 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Forceful destruction successful, exit code 0 [2023-12-02 13:06:30,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2023-12-02 13:06:30,533 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (39)] Ended with exit code 0 [2023-12-02 13:06:30,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:06:30,724 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:06:30,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:06:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715296, now seen corresponding path program 1 times [2023-12-02 13:06:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:06:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [898457799] [2023-12-02 13:06:30,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:06:30,725 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-12-02 13:06:30,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:06:30,726 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:06:30,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-12-02 13:06:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:06:31,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 67 conjunts are in the unsatisfiable core [2023-12-02 13:06:31,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:06:31,772 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-12-02 13:06:32,003 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:06:32,003 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-12-02 13:06:32,054 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-12-02 13:06:32,177 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-12-02 13:06:33,640 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:33,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:06:33,802 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:33,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:06:33,932 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:33,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:06:33,948 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-12-02 13:06:34,019 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:06:34,019 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:06:34,122 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7286) |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-12-02 13:06:34,137 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7286 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:06:34,159 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (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$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7285))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:06:34,177 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 13:06:34,728 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7332 (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$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7332))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7285)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7286)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:06:34,732 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:06:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [898457799] [2023-12-02 13:06:34,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [898457799] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:06:34,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1912029969] [2023-12-02 13:06:34,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:06:34,733 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:06:34,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:06:34,734 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:06:34,735 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-12-02 13:06:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:06:40,214 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-02 13:06:40,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:06:40,227 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-12-02 13:06:40,590 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:06:40,590 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-12-02 13:06:40,667 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-12-02 13:06:40,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 13:06:42,082 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:06:42,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 36 treesize of output 35 [2023-12-02 13:06:42,288 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:06:42,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:06:42,418 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:06:42,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:06:42,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 13:06:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:06:42,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:06:42,466 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7787) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2023-12-02 13:06:42,480 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7787) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:06:42,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (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$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7786))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7787)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:06:42,513 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7787)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 13:06:43,005 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (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$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7833))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7787)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 13:06:43,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1912029969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:06:43,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582040659] [2023-12-02 13:06:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:06:43,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:06:43,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:06:43,010 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:06:43,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2023-12-02 13:06:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:06:43,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 13:06:43,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:06:43,915 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:06:43,916 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-12-02 13:06:43,969 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-12-02 13:06:44,750 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:44,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 13:06:44,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:44,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 13:06:44,939 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:06:44,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:06:45,017 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-12-02 13:06:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:06:45,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:06:45,042 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 13:06:45,042 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-12-02 13:06:45,194 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 13:06:45,209 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8285)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 13:06:45,221 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8285))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 13:06:45,681 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8332 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8332))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8285)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_8286) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 13:06:45,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582040659] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:06:45,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:06:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 32 [2023-12-02 13:06:45,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399650575] [2023-12-02 13:06:45,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:06:45,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 13:06:45,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:06:45,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 13:06:45,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1036, Unknown=24, NotChecked=1106, Total=2352 [2023-12-02 13:06:45,687 INFO L87 Difference]: Start difference. First operand 1720 states and 2537 transitions. Second operand has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:07:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:07:04,816 INFO L93 Difference]: Finished difference Result 2105 states and 3047 transitions. [2023-12-02 13:07:04,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 13:07:04,816 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 124 [2023-12-02 13:07:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:07:04,821 INFO L225 Difference]: With dead ends: 2105 [2023-12-02 13:07:04,821 INFO L226 Difference]: Without dead ends: 2105 [2023-12-02 13:07:04,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 344 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=267, Invalid=1657, Unknown=24, NotChecked=1358, Total=3306 [2023-12-02 13:07:04,823 INFO L413 NwaCegarLoop]: 381 mSDtfsCounter, 1390 mSDsluCounter, 5921 mSDsCounter, 0 mSdLazyCounter, 8308 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 6302 SdHoareTripleChecker+Invalid, 8356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 8308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:07:04,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 6302 Invalid, 8356 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 8308 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2023-12-02 13:07:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2105 states. [2023-12-02 13:07:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2105 to 1719. [2023-12-02 13:07:04,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1719 states, 1295 states have (on average 1.9057915057915058) internal successors, (2468), 1679 states have internal predecessors, (2468), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 13:07:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2535 transitions. [2023-12-02 13:07:04,847 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2535 transitions. Word has length 124 [2023-12-02 13:07:04,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:07:04,848 INFO L495 AbstractCegarLoop]: Abstraction has 1719 states and 2535 transitions. [2023-12-02 13:07:04,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 27 states have (on average 5.888888888888889) internal successors, (159), 28 states have internal predecessors, (159), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:07:04,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2535 transitions. [2023-12-02 13:07:04,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-02 13:07:04,849 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:07:04,849 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:07:04,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Ended with exit code 0 [2023-12-02 13:07:05,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Ended with exit code 0 [2023-12-02 13:07:05,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2023-12-02 13:07:05,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:07:05,450 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:07:05,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:07:05,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1169715295, now seen corresponding path program 1 times [2023-12-02 13:07:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:07:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78111550] [2023-12-02 13:07:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:05,451 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-12-02 13:07:05,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:07:05,452 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:07:05,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2023-12-02 13:07:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:07:06,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 13:07:06,477 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:07:06,484 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-12-02 13:07:06,833 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-12-02 13:07:06,880 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:07:06,880 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-12-02 13:07:06,925 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-12-02 13:07:06,933 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-12-02 13:07:07,061 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-12-02 13:07:07,066 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-12-02 13:07:08,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:08,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:07:08,173 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-12-02 13:07:08,331 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:08,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:07:08,341 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-12-02 13:07:08,465 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:07:08,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:07:08,471 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-12-02 13:07:08,495 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-12-02 13:07:08,503 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-12-02 13:07:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:07:08,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:07:08,774 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd (_ bv12 32) .cse0)))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 13:07:09,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8832))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8833) .cse0 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8833) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse3) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-12-02 13:07:09,157 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8832))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8833) .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8833) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 13:07:11,483 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8926))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8832))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8927) .cse0 v_ArrVal_8833) .cse1 v_ArrVal_8835) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8926 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8833 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8832 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8926))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8927) .cse6 v_ArrVal_8833) (select (select (store .cse7 .cse6 v_ArrVal_8832) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8835))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 13:07:11,495 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:07:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78111550] [2023-12-02 13:07:11,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78111550] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:07:11,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1280061567] [2023-12-02 13:07:11,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:07:11,495 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:07:11,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:07:11,496 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:07:11,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-12-02 13:09:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:09:00,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 13:09:00,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:09:00,779 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-12-02 13:09:01,284 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-12-02 13:09:01,324 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:09:01,325 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-12-02 13:09:01,345 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-12-02 13:09:01,357 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-12-02 13:09:01,458 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-12-02 13:09:01,465 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-12-02 13:09:02,800 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:09:02,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:09:02,808 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-12-02 13:09:02,939 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:09:02,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:09:02,955 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-12-02 13:09:03,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:09:03,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:09:03,036 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-12-02 13:09:03,067 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-12-02 13:09:03,078 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-12-02 13:09:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:09:03,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:09:03,150 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 13:09:03,187 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv12 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))))) is different from false [2023-12-02 13:09:03,235 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9428) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9427))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9428) .cse2 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:09:03,288 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9427))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9428) .cse1 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_9428) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse4) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 13:09:04,906 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9429 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9522))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_9427))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9521) .cse0 v_ArrVal_9428) .cse1 v_ArrVal_9430) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_9429) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_9430 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9428 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9522))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9521) .cse6 v_ArrVal_9428) (select (select (store .cse7 .cse6 v_ArrVal_9427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_9430))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 13:09:04,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1280061567] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:09:04,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225861245] [2023-12-02 13:09:04,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:09:04,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:09:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:09:04,922 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:09:04,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-12-02 13:09:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:09:05,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 122 conjunts are in the unsatisfiable core [2023-12-02 13:09:05,683 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:09:05,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 13:09:06,033 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:09:06,034 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-12-02 13:09:06,143 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-12-02 13:09:06,162 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-12-02 13:09:06,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-12-02 13:09:06,452 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-12-02 13:09:07,754 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:09:07,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:09:07,771 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-12-02 13:09:08,037 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:09:08,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:09:08,052 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-12-02 13:09:08,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:09:08,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:09:08,241 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-12-02 13:09:08,254 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-12-02 13:09:08,264 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-12-02 13:09:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:09:08,269 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:09:08,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_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 13:09:08,375 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:09:08,497 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10022) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10021))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10022) .cse2 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:09:08,592 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10021))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10022) .cse1 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10022) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))))) is different from false [2023-12-02 13:09:10,303 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10115))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10116) .cse1 v_ArrVal_10022) (select (select (store .cse2 .cse1 v_ArrVal_10021) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10024))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10021 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10022 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10023 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10024 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10115 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10116 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10115))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10021))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10116) .cse4 v_ArrVal_10022) .cse5 v_ArrVal_10024) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10023) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:09:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225861245] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:09:10,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:09:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 21 [2023-12-02 13:09:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147219582] [2023-12-02 13:09:10,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:09:10,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:09:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:09:10,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:09:10,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=521, Unknown=22, NotChecked=826, Total=1482 [2023-12-02 13:09:10,319 INFO L87 Difference]: Start difference. First operand 1719 states and 2535 transitions. Second operand has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 13:09:57,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:09:57,694 INFO L93 Difference]: Finished difference Result 2415 states and 3348 transitions. [2023-12-02 13:09:57,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-02 13:09:57,695 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-12-02 13:09:57,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:09:57,698 INFO L225 Difference]: With dead ends: 2415 [2023-12-02 13:09:57,698 INFO L226 Difference]: Without dead ends: 2415 [2023-12-02 13:09:57,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 351 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=191, Invalid=965, Unknown=22, NotChecked=1078, Total=2256 [2023-12-02 13:09:57,699 INFO L413 NwaCegarLoop]: 618 mSDtfsCounter, 1177 mSDsluCounter, 6172 mSDsCounter, 0 mSdLazyCounter, 15499 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 6790 SdHoareTripleChecker+Invalid, 15526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 15499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:09:57,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 6790 Invalid, 15526 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [27 Valid, 15499 Invalid, 0 Unknown, 0 Unchecked, 46.4s Time] [2023-12-02 13:09:57,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2415 states. [2023-12-02 13:09:57,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2415 to 1718. [2023-12-02 13:09:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1295 states have (on average 1.9042471042471043) internal successors, (2466), 1678 states have internal predecessors, (2466), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 13:09:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2533 transitions. [2023-12-02 13:09:57,723 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2533 transitions. Word has length 124 [2023-12-02 13:09:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:09:57,723 INFO L495 AbstractCegarLoop]: Abstraction has 1718 states and 2533 transitions. [2023-12-02 13:09:57,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-02 13:09:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2533 transitions. [2023-12-02 13:09:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 13:09:57,724 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:09:57,724 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:09:57,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (45)] Ended with exit code 0 [2023-12-02 13:09:57,962 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2023-12-02 13:09:58,138 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2023-12-02 13:09:58,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:09:58,325 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:09:58,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:09:58,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384054, now seen corresponding path program 1 times [2023-12-02 13:09:58,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:09:58,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442139743] [2023-12-02 13:09:58,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:09:58,326 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-12-02 13:09:58,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:09:58,327 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:09:58,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2023-12-02 13:09:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:09:59,585 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 70 conjunts are in the unsatisfiable core [2023-12-02 13:09:59,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:09:59,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 13:09:59,882 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:09:59,882 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-12-02 13:09:59,947 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-12-02 13:10:00,098 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-12-02 13:10:01,841 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:01,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:02,035 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:02,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:02,184 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:02,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:02,345 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:02,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 44 treesize of output 43 [2023-12-02 13:10:02,363 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-12-02 13:10:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:10:02,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:10:02,566 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10587) |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-12-02 13:10:02,582 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10587 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_10587) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:10:02,602 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (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$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:02,621 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:02,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (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$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10585))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:02,667 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10585))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:03,218 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_10586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10587 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10585 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10633 (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 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10633))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10585)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10586)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10587)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 13:10:03,223 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:10:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442139743] [2023-12-02 13:10:03,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442139743] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:10:03,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [195559986] [2023-12-02 13:10:03,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:10:03,223 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:10:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:10:03,224 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:10:03,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-12-02 13:10:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:10:11,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 13:10:11,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:10:11,172 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-12-02 13:10:11,730 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 13:10:11,730 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-12-02 13:10:11,863 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-12-02 13:10:12,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-02 13:10:13,662 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:13,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:10:13,923 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:13,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:10:14,102 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:14,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:10:14,297 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:14,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 13:10:14,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 13:10:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:10:14,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:10:16,496 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11104 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_11104) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 13:10:16,518 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (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$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11103))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:10:16,539 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:16,564 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (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$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 13:10:16,590 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (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$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11102))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:17,182 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11103 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11102 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11150 (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$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11150))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11102)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11103)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 13:10:17,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [195559986] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:10:17,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608301271] [2023-12-02 13:10:17,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:10:17,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:10:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:10:17,189 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:10:17,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-12-02 13:10:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:10:18,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 13:10:18,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:10:18,046 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-12-02 13:10:18,358 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:10:18,359 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-12-02 13:10:18,442 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-12-02 13:10:19,603 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:19,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 13:10:19,767 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:19,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2023-12-02 13:10:19,926 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:19,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:20,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 13:10:20,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 13:10:20,247 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-12-02 13:10:20,253 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:10:20,254 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:10:22,429 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 13:10:22,430 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-12-02 13:10:22,442 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (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$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem75#1.base|)) is different from false [2023-12-02 13:10:22,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 13:10:22,477 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_11618)) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= (select (select (let ((.cse0 (store .cse2 .cse3 v_ArrVal_11619))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2023-12-02 13:10:22,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11618))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_11619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:10:23,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11666 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_11666))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11618)))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (let ((.cse1 (store .cse3 .cse0 v_ArrVal_11619))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11104)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 13:10:23,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608301271] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:10:23,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:10:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 35 [2023-12-02 13:10:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56679909] [2023-12-02 13:10:23,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:10:23,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-12-02 13:10:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 13:10:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-12-02 13:10:23,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1236, Unknown=24, NotChecked=1602, Total=3080 [2023-12-02 13:10:23,050 INFO L87 Difference]: Start difference. First operand 1718 states and 2533 transitions. Second operand has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:10:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:10:43,418 INFO L93 Difference]: Finished difference Result 2103 states and 3043 transitions. [2023-12-02 13:10:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:10:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 126 [2023-12-02 13:10:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:10:43,422 INFO L225 Difference]: With dead ends: 2103 [2023-12-02 13:10:43,422 INFO L226 Difference]: Without dead ends: 2103 [2023-12-02 13:10:43,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 348 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=299, Invalid=1911, Unknown=24, NotChecked=1926, Total=4160 [2023-12-02 13:10:43,424 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 1405 mSDsluCounter, 4876 mSDsCounter, 0 mSdLazyCounter, 6965 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1408 SdHoareTripleChecker+Valid, 5256 SdHoareTripleChecker+Invalid, 7032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 6965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:10:43,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1408 Valid, 5256 Invalid, 7032 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [67 Valid, 6965 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2023-12-02 13:10:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2023-12-02 13:10:43,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1717. [2023-12-02 13:10:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1295 states have (on average 1.9027027027027028) internal successors, (2464), 1677 states have internal predecessors, (2464), 34 states have call successors, (34), 18 states have call predecessors, (34), 17 states have return successors, (33), 24 states have call predecessors, (33), 30 states have call successors, (33) [2023-12-02 13:10:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2531 transitions. [2023-12-02 13:10:43,446 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2531 transitions. Word has length 126 [2023-12-02 13:10:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:10:43,446 INFO L495 AbstractCegarLoop]: Abstraction has 1717 states and 2531 transitions. [2023-12-02 13:10:43,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 30 states have (on average 5.366666666666666) internal successors, (161), 31 states have internal predecessors, (161), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2023-12-02 13:10:43,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2531 transitions. [2023-12-02 13:10:43,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-02 13:10:43,447 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:10:43,447 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:10:43,469 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2023-12-02 13:10:43,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2023-12-02 13:10:43,857 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (48)] Ended with exit code 0 [2023-12-02 13:10:44,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:10:44,048 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 525 more)] === [2023-12-02 13:10:44,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:10:44,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1186384055, now seen corresponding path program 1 times [2023-12-02 13:10:44,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 13:10:44,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27826187] [2023-12-02 13:10:44,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:10:44,049 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-12-02 13:10:44,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 13:10:44,050 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -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-12-02 13:10:44,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2023-12-02 13:10:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:10:45,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-02 13:10:45,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:10:45,241 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-12-02 13:10:45,751 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-12-02 13:10:45,814 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:10:45,814 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-12-02 13:10:45,883 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-12-02 13:10:45,894 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-12-02 13:10:46,078 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-12-02 13:10:46,085 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-12-02 13:10:47,551 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:47,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:47,567 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-12-02 13:10:47,784 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:47,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:47,791 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-12-02 13:10:47,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:47,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:47,967 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-12-02 13:10:48,133 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:10:48,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:10:48,141 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-12-02 13:10:48,167 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-12-02 13:10:48,174 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-12-02 13:10:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:10:48,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:10:48,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv24 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv20 32) .cse1) (bvadd (_ bv24 32) .cse1)))))) is different from false [2023-12-02 13:10:48,537 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:10:48,717 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12184) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12183))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:10:48,818 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12184) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12183))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12184) .cse3 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:10:48,924 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12181))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12182) .cse1 v_ArrVal_12184) (select (select (store .cse2 .cse1 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12181))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12183))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12182) .cse4 v_ArrVal_12184) .cse5 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:10:49,025 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12181))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12183))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12182) .cse1 v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12181))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12182) .cse7 v_ArrVal_12184) (select (select (store .cse8 .cse7 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))))) is different from false [2023-12-02 13:10:52,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12277))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12181))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12183))) (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$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12278) .cse0 v_ArrVal_12182) .cse1 v_ArrVal_12184) .cse2 v_ArrVal_12186) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12277 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12186 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12278 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12181 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12182 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12277))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12181))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12278) .cse8 v_ArrVal_12182) .cse9 v_ArrVal_12184) (select (select (store .cse10 .cse9 v_ArrVal_12183) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12186))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 13:10:52,953 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 13:10:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27826187] [2023-12-02 13:10:52,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27826187] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:10:52,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [57346080] [2023-12-02 13:10:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:10:52,953 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 13:10:52,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 13:10:52,954 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 13:10:52,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process [2023-12-02 13:13:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:13:52,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 128 conjunts are in the unsatisfiable core [2023-12-02 13:13:52,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:13:52,975 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-12-02 13:13:54,688 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-12-02 13:13:54,841 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:13:54,841 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-12-02 13:13:54,880 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-12-02 13:13:54,913 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-12-02 13:13:55,213 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-12-02 13:13:55,232 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-12-02 13:13:59,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:13:59,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:13:59,289 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-12-02 13:13:59,669 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:13:59,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:13:59,704 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-12-02 13:13:59,967 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:13:59,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:14:00,018 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-12-02 13:14:00,241 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 13:14:00,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12-02 13:14:00,293 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-12-02 13:14:00,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-02 13:14:00,365 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-12-02 13:14:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-12-02 13:14:00,382 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:14:00,547 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32))))))) is different from false [2023-12-02 13:14:00,629 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 13:14:00,788 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12796) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12795))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_12796) .cse2 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 13:14:00,952 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12796) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12795))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12796) .cse3 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-12-02 13:14:01,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12793))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12794) .cse1 v_ArrVal_12796) (select (select (store .cse2 .cse1 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12798))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12793))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_12795))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_12794) .cse4 v_ArrVal_12796) .cse5 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 13:14:01,398 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$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12793))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12794) .cse2 v_ArrVal_12796) (select (select (store .cse3 .cse2 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_12798))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_12793))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_12795))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_12794) .cse5 v_ArrVal_12796) .cse6 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 13:14:06,724 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_12889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12890))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_12793))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_12795))) (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$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12889) .cse0 v_ArrVal_12794) .cse1 v_ArrVal_12796) .cse2 v_ArrVal_12798) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_12797) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_12889 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12796 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12795 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12798 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12890 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12794 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12890))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_12793))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_12889) .cse8 v_ArrVal_12794) .cse9 v_ArrVal_12796) (select (select (store .cse10 .cse9 v_ArrVal_12795) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_12798))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32))))))) is different from false [2023-12-02 13:14:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [57346080] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:14:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293339515] [2023-12-02 13:14:06,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:14:06,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:14:06,760 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:14:06,761 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:14:06,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c99a45d9-a600-40cf-9b00-c201a57689a9/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2023-12-02 13:14:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:14:07,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 125 conjunts are in the unsatisfiable core [2023-12-02 13:14:07,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:14:08,840 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-12-02 13:14:08,955 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 13:14:08,955 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-12-02 13:14:09,303 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-12-02 13:14:09,341 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