./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/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 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:02:34,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:02:34,990 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 15:02:34,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:02:34,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:02:35,018 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:02:35,018 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:02:35,019 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:02:35,020 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:02:35,020 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:02:35,021 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:02:35,021 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:02:35,022 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:02:35,022 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 15:02:35,023 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:02:35,023 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:02:35,023 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 15:02:35,024 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 15:02:35,024 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:02:35,025 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 15:02:35,025 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 15:02:35,026 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 15:02:35,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:02:35,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:02:35,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:02:35,028 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:02:35,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:02:35,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:02:35,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:02:35,030 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:02:35,031 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:02:35,031 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:02:35,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:02:35,032 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:02:35,032 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:02:35,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:02:35,033 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:02:35,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:02:35,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:02:35,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:02:35,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:02:35,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:02:35,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:02:35,039 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 15:02:35,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 15:02:35,039 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:02:35,039 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:02:35,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:02:35,040 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_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2023-12-02 15:02:35,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:02:35,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:02:35,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:02:35,293 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:02:35,293 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:02:35,294 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2023-12-02 15:02:38,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:02:38,324 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:02:38,325 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2023-12-02 15:02:38,341 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data/ef72ff900/adc53a3378bb4e9aa03c8903cea2d843/FLAGf50e2b404 [2023-12-02 15:02:38,354 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data/ef72ff900/adc53a3378bb4e9aa03c8903cea2d843 [2023-12-02 15:02:38,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:02:38,357 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:02:38,358 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:02:38,358 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:02:38,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:02:38,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:02:38" (1/1) ... [2023-12-02 15:02:38,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a219406 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:38, skipping insertion in model container [2023-12-02 15:02:38,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:02:38" (1/1) ... [2023-12-02 15:02:38,422 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:02:38,878 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:02:38,890 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 15:02:38,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@658295a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:38, skipping insertion in model container [2023-12-02 15:02:38,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:02:38,891 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 15:02:38,893 INFO L158 Benchmark]: Toolchain (without parser) took 534.88ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 84.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 15:02:38,893 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 15:02:38,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.66ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 84.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-12-02 15:02:38,895 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.14ms. Allocated memory is still 142.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.66ms. Allocated memory is still 142.6MB. Free memory was 108.2MB in the beginning and 84.2MB in the end (delta: 24.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 737]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/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 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 15:02:40,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 15:02:40,673 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 15:02:40,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 15:02:40,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 15:02:40,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 15:02:40,708 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 15:02:40,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 15:02:40,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 15:02:40,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 15:02:40,710 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 15:02:40,711 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 15:02:40,711 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 15:02:40,712 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 15:02:40,712 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 15:02:40,713 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 15:02:40,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 15:02:40,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 15:02:40,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 15:02:40,715 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 15:02:40,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 15:02:40,716 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 15:02:40,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 15:02:40,717 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 15:02:40,717 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 15:02:40,717 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 15:02:40,718 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 15:02:40,718 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 15:02:40,719 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 15:02:40,719 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 15:02:40,719 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 15:02:40,720 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 15:02:40,720 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 15:02:40,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 15:02:40,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 15:02:40,721 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 15:02:40,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 15:02:40,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:02:40,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 15:02:40,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 15:02:40,722 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 15:02:40,722 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 15:02:40,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 15:02:40,723 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 15:02:40,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 15:02:40,723 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_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/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 -> 713ae5dee39d08db1e818ebc31454a222c136fde7aad4a26405d3060cfa0eeea [2023-12-02 15:02:41,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 15:02:41,028 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 15:02:41,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 15:02:41,032 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 15:02:41,033 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 15:02:41,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2023-12-02 15:02:43,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 15:02:44,162 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 15:02:44,162 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test5-3.i [2023-12-02 15:02:44,184 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data/025c91a89/fc52ca9c6b2a414c84451049d1d5e938/FLAG69bb9c048 [2023-12-02 15:02:44,197 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/data/025c91a89/fc52ca9c6b2a414c84451049d1d5e938 [2023-12-02 15:02:44,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 15:02:44,201 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 15:02:44,202 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 15:02:44,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 15:02:44,207 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 15:02:44,208 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:02:44" (1/1) ... [2023-12-02 15:02:44,209 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@111f1e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:44, skipping insertion in model container [2023-12-02 15:02:44,209 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:02:44" (1/1) ... [2023-12-02 15:02:44,271 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:02:44,732 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:02:44,747 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 15:02:44,760 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 15:02:44,882 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:02:44,887 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 15:02:44,978 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 15:02:45,007 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 15:02:45,013 INFO L206 MainTranslator]: Completed translation [2023-12-02 15:02:45,014 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45 WrapperNode [2023-12-02 15:02:45,014 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 15:02:45,015 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 15:02:45,015 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 15:02:45,015 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 15:02:45,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,132 INFO L138 Inliner]: procedures = 180, calls = 489, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1732 [2023-12-02 15:02:45,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 15:02:45,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 15:02:45,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 15:02:45,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 15:02:45,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,273 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,288 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 15:02:45,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 15:02:45,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 15:02:45,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 15:02:45,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (1/1) ... [2023-12-02 15:02:45,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 15:02:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:02:45,319 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 15:02:45,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 15:02:45,364 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-12-02 15:02:45,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-12-02 15:02:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 15:02:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 15:02:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 15:02:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 15:02:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 15:02:45,365 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 15:02:45,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 15:02:45,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 15:02:45,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 15:02:45,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 15:02:45,601 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 15:02:45,604 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 15:02:45,627 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 15:02:52,358 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 15:02:52,572 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 15:02:52,573 INFO L309 CfgBuilder]: Removed 100 assume(true) statements. [2023-12-02 15:02:52,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:02:52 BoogieIcfgContainer [2023-12-02 15:02:52,574 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 15:02:52,576 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 15:02:52,576 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 15:02:52,579 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 15:02:52,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:02:44" (1/3) ... [2023-12-02 15:02:52,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10393c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:02:52, skipping insertion in model container [2023-12-02 15:02:52,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:02:45" (2/3) ... [2023-12-02 15:02:52,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10393c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:02:52, skipping insertion in model container [2023-12-02 15:02:52,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:02:52" (3/3) ... [2023-12-02 15:02:52,581 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test5-3.i [2023-12-02 15:02:52,600 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 15:02:52,600 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 931 error locations. [2023-12-02 15:02:52,671 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 15:02:52,677 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;@643d199b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 15:02:52,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 931 error locations. [2023-12-02 15:02:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 1672 states, 730 states have (on average 2.543835616438356) internal successors, (1857), 1662 states have internal predecessors, (1857), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-02 15:02:52,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:02:52,693 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:02:52,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:02:52,694 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:02:52,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:02:52,699 INFO L85 PathProgramCache]: Analyzing trace with hash 86570822, now seen corresponding path program 1 times [2023-12-02 15:02:52,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:02:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851743670] [2023-12-02 15:02:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:52,711 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 15:02:52,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:02:52,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:02:52,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:02:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:52,897 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:02:52,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:52,962 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 15:02:52,975 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 15:02:52,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:02:52,976 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:02:52,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851743670] [2023-12-02 15:02:52,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851743670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:02:52,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:02:52,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:02:52,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946113044] [2023-12-02 15:02:52,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:02:52,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:02:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:02:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:02:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:02:53,025 INFO L87 Difference]: Start difference. First operand has 1672 states, 730 states have (on average 2.543835616438356) internal successors, (1857), 1662 states have internal predecessors, (1857), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:02:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:02:56,377 INFO L93 Difference]: Finished difference Result 1881 states and 2026 transitions. [2023-12-02 15:02:56,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:02:56,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 15:02:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:02:56,401 INFO L225 Difference]: With dead ends: 1881 [2023-12-02 15:02:56,401 INFO L226 Difference]: Without dead ends: 1880 [2023-12-02 15:02:56,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:02:56,405 INFO L413 NwaCegarLoop]: 1114 mSDtfsCounter, 1235 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:02:56,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 1513 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-02 15:02:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2023-12-02 15:02:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1626. [2023-12-02 15:02:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 787 states have (on average 2.238881829733164) internal successors, (1762), 1616 states have internal predecessors, (1762), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:02:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 1786 transitions. [2023-12-02 15:02:56,501 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 1786 transitions. Word has length 4 [2023-12-02 15:02:56,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:02:56,502 INFO L495 AbstractCegarLoop]: Abstraction has 1626 states and 1786 transitions. [2023-12-02 15:02:56,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:02:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1786 transitions. [2023-12-02 15:02:56,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 15:02:56,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:02:56,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 15:02:56,506 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:02:56,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:02:56,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:02:56,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:02:56,707 INFO L85 PathProgramCache]: Analyzing trace with hash 86570823, now seen corresponding path program 1 times [2023-12-02 15:02:56,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:02:56,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377921981] [2023-12-02 15:02:56,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:02:56,708 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 15:02:56,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:02:56,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:02:56,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:02:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:02:56,836 INFO L262 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:02:56,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:02:56,848 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 15:02:56,896 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 15:02:56,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:02:56,896 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:02:56,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377921981] [2023-12-02 15:02:56,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377921981] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:02:56,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:02:56,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:02:56,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164559891] [2023-12-02 15:02:56,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:02:56,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:02:56,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:02:56,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:02:56,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:02:56,900 INFO L87 Difference]: Start difference. First operand 1626 states and 1786 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:01,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:01,816 INFO L93 Difference]: Finished difference Result 2095 states and 2306 transitions. [2023-12-02 15:03:01,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:01,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 15:03:01,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:01,825 INFO L225 Difference]: With dead ends: 2095 [2023-12-02 15:03:01,826 INFO L226 Difference]: Without dead ends: 2095 [2023-12-02 15:03:01,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:01,827 INFO L413 NwaCegarLoop]: 1442 mSDtfsCounter, 673 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 1276 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 2102 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:01,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 2102 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1276 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 15:03:01,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2023-12-02 15:03:01,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1749. [2023-12-02 15:03:01,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1749 states, 920 states have (on average 2.2119565217391304) internal successors, (2035), 1739 states have internal predecessors, (2035), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2059 transitions. [2023-12-02 15:03:01,864 INFO L78 Accepts]: Start accepts. Automaton has 1749 states and 2059 transitions. Word has length 4 [2023-12-02 15:03:01,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:01,865 INFO L495 AbstractCegarLoop]: Abstraction has 1749 states and 2059 transitions. [2023-12-02 15:03:01,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1749 states and 2059 transitions. [2023-12-02 15:03:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 15:03:01,865 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:01,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 15:03:01,868 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:02,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:02,069 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr640REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:02,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1609580539, now seen corresponding path program 1 times [2023-12-02 15:03:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:02,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632135487] [2023-12-02 15:03:02,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:02,070 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 15:03:02,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:02,072 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:02,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:02,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:03:02,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:02,245 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 15:03:02,245 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:02,245 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632135487] [2023-12-02 15:03:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632135487] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:02,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:03:02,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980831923] [2023-12-02 15:03:02,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:02,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:02,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:02,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:02,248 INFO L87 Difference]: Start difference. First operand 1749 states and 2059 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:04,031 INFO L93 Difference]: Finished difference Result 3134 states and 3735 transitions. [2023-12-02 15:03:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:04,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 15:03:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:04,045 INFO L225 Difference]: With dead ends: 3134 [2023-12-02 15:03:04,046 INFO L226 Difference]: Without dead ends: 3134 [2023-12-02 15:03:04,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:04,047 INFO L413 NwaCegarLoop]: 1689 mSDtfsCounter, 1243 mSDsluCounter, 1466 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1254 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:04,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1254 Valid, 3155 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 15:03:04,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3134 states. [2023-12-02 15:03:04,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3134 to 1751. [2023-12-02 15:03:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 922 states have (on average 2.2093275488069413) internal successors, (2037), 1741 states have internal predecessors, (2037), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2061 transitions. [2023-12-02 15:03:04,103 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2061 transitions. Word has length 5 [2023-12-02 15:03:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:04,103 INFO L495 AbstractCegarLoop]: Abstraction has 1751 states and 2061 transitions. [2023-12-02 15:03:04,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:04,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2061 transitions. [2023-12-02 15:03:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 15:03:04,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:04,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:04,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:04,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:04,305 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:04,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:04,305 INFO L85 PathProgramCache]: Analyzing trace with hash 800881168, now seen corresponding path program 1 times [2023-12-02 15:03:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:04,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946991350] [2023-12-02 15:03:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:04,306 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 15:03:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:04,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:04,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:04,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 15:03:04,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:04,500 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 15:03:04,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:04,500 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:04,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946991350] [2023-12-02 15:03:04,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946991350] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:04,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:04,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:03:04,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369710686] [2023-12-02 15:03:04,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:04,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:04,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:04,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:04,503 INFO L87 Difference]: Start difference. First operand 1751 states and 2061 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:05,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:05,712 INFO L93 Difference]: Finished difference Result 1712 states and 2021 transitions. [2023-12-02 15:03:05,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:05,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 15:03:05,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:05,722 INFO L225 Difference]: With dead ends: 1712 [2023-12-02 15:03:05,722 INFO L226 Difference]: Without dead ends: 1712 [2023-12-02 15:03:05,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:05,723 INFO L413 NwaCegarLoop]: 1426 mSDtfsCounter, 70 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 2803 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:05,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 2803 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-02 15:03:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2023-12-02 15:03:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2023-12-02 15:03:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 907 states have (on average 2.201764057331863) internal successors, (1997), 1702 states have internal predecessors, (1997), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:05,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2021 transitions. [2023-12-02 15:03:05,754 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2021 transitions. Word has length 10 [2023-12-02 15:03:05,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:05,754 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2021 transitions. [2023-12-02 15:03:05,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2021 transitions. [2023-12-02 15:03:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 15:03:05,755 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:05,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:05,757 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:05,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:05,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:05,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:05,956 INFO L85 PathProgramCache]: Analyzing trace with hash 847652586, now seen corresponding path program 1 times [2023-12-02 15:03:05,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:05,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235769343] [2023-12-02 15:03:05,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:05,957 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 15:03:05,957 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:05,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:05,959 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:06,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:03:06,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:06,150 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 15:03:06,150 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:06,150 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235769343] [2023-12-02 15:03:06,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235769343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:06,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:06,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:06,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389080579] [2023-12-02 15:03:06,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:06,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:06,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:06,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:06,152 INFO L87 Difference]: Start difference. First operand 1712 states and 2021 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:07,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:07,627 INFO L93 Difference]: Finished difference Result 1698 states and 2000 transitions. [2023-12-02 15:03:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-12-02 15:03:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:07,636 INFO L225 Difference]: With dead ends: 1698 [2023-12-02 15:03:07,636 INFO L226 Difference]: Without dead ends: 1698 [2023-12-02 15:03:07,636 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 15:03:07,637 INFO L413 NwaCegarLoop]: 1395 mSDtfsCounter, 58 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4161 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:07,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4161 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 15:03:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2023-12-02 15:03:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1697. [2023-12-02 15:03:07,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 906 states have (on average 2.1799116997792494) internal successors, (1975), 1687 states have internal predecessors, (1975), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 1999 transitions. [2023-12-02 15:03:07,663 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 1999 transitions. Word has length 12 [2023-12-02 15:03:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:07,663 INFO L495 AbstractCegarLoop]: Abstraction has 1697 states and 1999 transitions. [2023-12-02 15:03:07,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 1999 transitions. [2023-12-02 15:03:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 15:03:07,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:07,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:07,667 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:03:07,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:07,865 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:07,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:07,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1534247208, now seen corresponding path program 1 times [2023-12-02 15:03:07,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:07,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690670373] [2023-12-02 15:03:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:07,866 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 15:03:07,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:07,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:07,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:08,017 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:03:08,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:08,025 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 15:03:08,099 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 15:03:08,099 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:08,099 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:08,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690670373] [2023-12-02 15:03:08,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690670373] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:08,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:08,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:03:08,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914037895] [2023-12-02 15:03:08,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:08,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:08,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:08,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:08,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:08,101 INFO L87 Difference]: Start difference. First operand 1697 states and 1999 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:12,016 INFO L93 Difference]: Finished difference Result 1948 states and 2235 transitions. [2023-12-02 15:03:12,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:12,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 15:03:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:12,029 INFO L225 Difference]: With dead ends: 1948 [2023-12-02 15:03:12,029 INFO L226 Difference]: Without dead ends: 1948 [2023-12-02 15:03:12,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:12,030 INFO L413 NwaCegarLoop]: 875 mSDtfsCounter, 1170 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1916 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:12,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1916 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-12-02 15:03:12,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2023-12-02 15:03:12,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1693. [2023-12-02 15:03:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 906 states have (on average 2.1754966887417218) internal successors, (1971), 1683 states have internal predecessors, (1971), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 1995 transitions. [2023-12-02 15:03:12,070 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 1995 transitions. Word has length 26 [2023-12-02 15:03:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:12,070 INFO L495 AbstractCegarLoop]: Abstraction has 1693 states and 1995 transitions. [2023-12-02 15:03:12,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 1995 transitions. [2023-12-02 15:03:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 15:03:12,071 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:12,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:12,074 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:12,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:12,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:12,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:12,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1534247207, now seen corresponding path program 1 times [2023-12-02 15:03:12,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:12,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382269499] [2023-12-02 15:03:12,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:12,275 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 15:03:12,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:12,276 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:12,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:12,418 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 15:03:12,420 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:12,430 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 15:03:12,601 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 15:03:12,601 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:12,601 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:12,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382269499] [2023-12-02 15:03:12,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382269499] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:12,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:12,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:03:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736130618] [2023-12-02 15:03:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:12,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:12,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:12,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:12,604 INFO L87 Difference]: Start difference. First operand 1693 states and 1995 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:18,338 INFO L93 Difference]: Finished difference Result 2036 states and 2239 transitions. [2023-12-02 15:03:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-12-02 15:03:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:18,349 INFO L225 Difference]: With dead ends: 2036 [2023-12-02 15:03:18,349 INFO L226 Difference]: Without dead ends: 2036 [2023-12-02 15:03:18,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:18,350 INFO L413 NwaCegarLoop]: 1201 mSDtfsCounter, 610 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 2535 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:18,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 2535 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-02 15:03:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2023-12-02 15:03:18,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1689. [2023-12-02 15:03:18,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1689 states, 906 states have (on average 2.171081677704194) internal successors, (1967), 1679 states have internal predecessors, (1967), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 1991 transitions. [2023-12-02 15:03:18,386 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 1991 transitions. Word has length 26 [2023-12-02 15:03:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:18,387 INFO L495 AbstractCegarLoop]: Abstraction has 1689 states and 1991 transitions. [2023-12-02 15:03:18,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:18,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 1991 transitions. [2023-12-02 15:03:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-02 15:03:18,389 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:18,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:18,392 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:18,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:18,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:18,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1976470610, now seen corresponding path program 1 times [2023-12-02 15:03:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1456969229] [2023-12-02 15:03:18,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:18,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:03:18,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:18,595 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:18,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:18,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:03:18,793 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:18,833 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 15:03:18,833 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:18,833 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1456969229] [2023-12-02 15:03:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1456969229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:18,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:18,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867822948] [2023-12-02 15:03:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:18,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:18,835 INFO L87 Difference]: Start difference. First operand 1689 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:20,458 INFO L93 Difference]: Finished difference Result 1683 states and 1981 transitions. [2023-12-02 15:03:20,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:20,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-12-02 15:03:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:20,466 INFO L225 Difference]: With dead ends: 1683 [2023-12-02 15:03:20,466 INFO L226 Difference]: Without dead ends: 1683 [2023-12-02 15:03:20,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:20,467 INFO L413 NwaCegarLoop]: 1389 mSDtfsCounter, 23 mSDsluCounter, 2758 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4147 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:20,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4147 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-02 15:03:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2023-12-02 15:03:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1683. [2023-12-02 15:03:20,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 900 states have (on average 2.1744444444444446) internal successors, (1957), 1673 states have internal predecessors, (1957), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 1981 transitions. [2023-12-02 15:03:20,490 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 1981 transitions. Word has length 42 [2023-12-02 15:03:20,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:20,490 INFO L495 AbstractCegarLoop]: Abstraction has 1683 states and 1981 transitions. [2023-12-02 15:03:20,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:20,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 1981 transitions. [2023-12-02 15:03:20,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 15:03:20,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:20,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:20,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:20,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:20,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1799549454, now seen corresponding path program 1 times [2023-12-02 15:03:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:20,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941407181] [2023-12-02 15:03:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:20,694 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 15:03:20,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:20,697 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:20,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:20,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:03:20,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:21,161 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 15:03:21,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:21,161 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:21,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941407181] [2023-12-02 15:03:21,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941407181] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:21,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:21,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 15:03:21,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526996387] [2023-12-02 15:03:21,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:21,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 15:03:21,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:21,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 15:03:21,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:21,163 INFO L87 Difference]: Start difference. First operand 1683 states and 1981 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:22,639 INFO L93 Difference]: Finished difference Result 2071 states and 2386 transitions. [2023-12-02 15:03:22,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 15:03:22,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-12-02 15:03:22,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:22,648 INFO L225 Difference]: With dead ends: 2071 [2023-12-02 15:03:22,648 INFO L226 Difference]: Without dead ends: 2071 [2023-12-02 15:03:22,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 15:03:22,649 INFO L413 NwaCegarLoop]: 1455 mSDtfsCounter, 419 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:22,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 2744 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 15:03:22,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2071 states. [2023-12-02 15:03:22,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2071 to 1726. [2023-12-02 15:03:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1726 states, 943 states have (on average 2.1208907741251326) internal successors, (2000), 1716 states have internal predecessors, (2000), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 2024 transitions. [2023-12-02 15:03:22,676 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 2024 transitions. Word has length 46 [2023-12-02 15:03:22,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:22,676 INFO L495 AbstractCegarLoop]: Abstraction has 1726 states and 2024 transitions. [2023-12-02 15:03:22,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:22,676 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 2024 transitions. [2023-12-02 15:03:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 15:03:22,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:22,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:22,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:22,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:22,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:22,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:22,884 INFO L85 PathProgramCache]: Analyzing trace with hash -703468275, now seen corresponding path program 1 times [2023-12-02 15:03:22,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:22,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066136666] [2023-12-02 15:03:22,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:22,885 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 15:03:22,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:22,886 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:22,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:23,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 15:03:23,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:23,213 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 15:03:23,220 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 15:03:23,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 15:03:23,676 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 15:03:23,694 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:03:23,694 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 15:03:23,711 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 15:03:23,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:23,712 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:23,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066136666] [2023-12-02 15:03:23,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066136666] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:23,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:23,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 15:03:23,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431506302] [2023-12-02 15:03:23,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:23,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:23,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:23,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:23,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:23,714 INFO L87 Difference]: Start difference. First operand 1726 states and 2024 transitions. Second operand has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:28,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:28,291 INFO L93 Difference]: Finished difference Result 1896 states and 2179 transitions. [2023-12-02 15:03:28,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:28,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2023-12-02 15:03:28,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:28,298 INFO L225 Difference]: With dead ends: 1896 [2023-12-02 15:03:28,298 INFO L226 Difference]: Without dead ends: 1896 [2023-12-02 15:03:28,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:28,298 INFO L413 NwaCegarLoop]: 626 mSDtfsCounter, 1377 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:28,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 1031 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 15:03:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2023-12-02 15:03:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1509. [2023-12-02 15:03:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 810 states have (on average 2.0148148148148146) internal successors, (1632), 1499 states have internal predecessors, (1632), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1656 transitions. [2023-12-02 15:03:28,318 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1656 transitions. Word has length 49 [2023-12-02 15:03:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:28,318 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1656 transitions. [2023-12-02 15:03:28,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.333333333333332) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:28,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1656 transitions. [2023-12-02 15:03:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 15:03:28,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:28,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:28,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:28,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:28,520 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:28,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash 37778570, now seen corresponding path program 1 times [2023-12-02 15:03:28,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:28,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40353808] [2023-12-02 15:03:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:28,522 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 15:03:28,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:28,523 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:28,524 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:28,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:28,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:03:28,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:28,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:03:28,820 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 15:03:28,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-02 15:03:28,848 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 15:03:28,848 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:28,848 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:28,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40353808] [2023-12-02 15:03:28,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40353808] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:28,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:28,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:28,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791565217] [2023-12-02 15:03:28,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:28,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:03:28,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:28,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:03:28,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:28,850 INFO L87 Difference]: Start difference. First operand 1509 states and 1656 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:33,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:33,371 INFO L93 Difference]: Finished difference Result 1508 states and 1655 transitions. [2023-12-02 15:03:33,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:33,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 15:03:33,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:33,377 INFO L225 Difference]: With dead ends: 1508 [2023-12-02 15:03:33,377 INFO L226 Difference]: Without dead ends: 1508 [2023-12-02 15:03:33,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:33,378 INFO L413 NwaCegarLoop]: 1317 mSDtfsCounter, 3 mSDsluCounter, 2078 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 2541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:33,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3395 Invalid, 2541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 15:03:33,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2023-12-02 15:03:33,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1508. [2023-12-02 15:03:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 810 states have (on average 2.0135802469135804) internal successors, (1631), 1498 states have internal predecessors, (1631), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1655 transitions. [2023-12-02 15:03:33,400 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1655 transitions. Word has length 53 [2023-12-02 15:03:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:33,400 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 1655 transitions. [2023-12-02 15:03:33,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1655 transitions. [2023-12-02 15:03:33,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 15:03:33,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:33,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:33,406 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:03:33,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:33,602 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:33,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:33,603 INFO L85 PathProgramCache]: Analyzing trace with hash 37778571, now seen corresponding path program 1 times [2023-12-02 15:03:33,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:33,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585842293] [2023-12-02 15:03:33,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:33,603 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 15:03:33,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:33,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:33,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:33,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-02 15:03:33,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:33,831 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 15:03:33,849 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 15:03:33,857 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 15:03:33,891 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 15:03:33,909 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 15:03:33,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:33,910 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:33,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585842293] [2023-12-02 15:03:33,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1585842293] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:33,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:33,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:33,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086753078] [2023-12-02 15:03:33,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:33,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 15:03:33,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:33,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 15:03:33,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:33,911 INFO L87 Difference]: Start difference. First operand 1508 states and 1655 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:39,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:39,696 INFO L93 Difference]: Finished difference Result 1507 states and 1654 transitions. [2023-12-02 15:03:39,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 15:03:39,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-12-02 15:03:39,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:39,702 INFO L225 Difference]: With dead ends: 1507 [2023-12-02 15:03:39,702 INFO L226 Difference]: Without dead ends: 1507 [2023-12-02 15:03:39,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-02 15:03:39,702 INFO L413 NwaCegarLoop]: 1317 mSDtfsCounter, 1 mSDsluCounter, 2134 mSDsCounter, 0 mSdLazyCounter, 2482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 2483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:39,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3451 Invalid, 2483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2482 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-02 15:03:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2023-12-02 15:03:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2023-12-02 15:03:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 809 states have (on average 2.0148331273176763) internal successors, (1630), 1497 states have internal predecessors, (1630), 13 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-02 15:03:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1654 transitions. [2023-12-02 15:03:39,718 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1654 transitions. Word has length 53 [2023-12-02 15:03:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:39,719 INFO L495 AbstractCegarLoop]: Abstraction has 1507 states and 1654 transitions. [2023-12-02 15:03:39,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 15:03:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1654 transitions. [2023-12-02 15:03:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-12-02 15:03:39,719 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:39,719 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 15:03:39,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:39,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:39,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:39,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:39,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1370884368, now seen corresponding path program 1 times [2023-12-02 15:03:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:39,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190342670] [2023-12-02 15:03:39,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:39,921 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 15:03:39,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:39,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:39,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:40,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 15:03:40,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:40,194 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 15:03:40,194 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 15:03:40,194 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:40,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190342670] [2023-12-02 15:03:40,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190342670] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 15:03:40,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 15:03:40,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 15:03:40,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507776792] [2023-12-02 15:03:40,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 15:03:40,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 15:03:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 15:03:40,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 15:03:40,195 INFO L87 Difference]: Start difference. First operand 1507 states and 1654 transitions. Second operand has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:41,969 INFO L93 Difference]: Finished difference Result 1509 states and 1658 transitions. [2023-12-02 15:03:41,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 15:03:41,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-12-02 15:03:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:41,978 INFO L225 Difference]: With dead ends: 1509 [2023-12-02 15:03:41,978 INFO L226 Difference]: Without dead ends: 1509 [2023-12-02 15:03:41,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 15:03:41,979 INFO L413 NwaCegarLoop]: 1316 mSDtfsCounter, 1 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3942 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:41,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3942 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 15:03:41,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2023-12-02 15:03:41,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2023-12-02 15:03:41,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 810 states have (on average 2.0148148148148146) internal successors, (1632), 1499 states have internal predecessors, (1632), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 15:03:42,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 1658 transitions. [2023-12-02 15:03:42,002 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 1658 transitions. Word has length 59 [2023-12-02 15:03:42,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:42,002 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 1658 transitions. [2023-12-02 15:03:42,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 19.0) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 15:03:42,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 1658 transitions. [2023-12-02 15:03:42,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 15:03:42,003 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:42,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:42,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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)] Ended with exit code 0 [2023-12-02 15:03:42,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:42,206 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:42,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:42,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1615046, now seen corresponding path program 1 times [2023-12-02 15:03:42,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:42,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792627045] [2023-12-02 15:03:42,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:42,212 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 15:03:42,212 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:42,213 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:42,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:42,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:03:42,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:42,492 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 15:03:42,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:42,546 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 15:03:42,546 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:42,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792627045] [2023-12-02 15:03:42,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792627045] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:42,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [688506600] [2023-12-02 15:03:42,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:42,547 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:03:42,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:03:42,548 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:03:42,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-12-02 15:03:42,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:42,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:03:42,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:42,992 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 15:03:42,992 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:43,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 15:03:43,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [688506600] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:43,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817766454] [2023-12-02 15:03:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:03:43,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:43,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:43,017 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:43,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 15:03:43,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:03:43,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 15:03:43,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:43,296 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 15:03:43,297 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:43,323 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 15:03:43,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817766454] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:43,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:03:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 15:03:43,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077367741] [2023-12-02 15:03:43,323 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:03:43,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 15:03:43,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:03:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 15:03:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 15:03:43,325 INFO L87 Difference]: Start difference. First operand 1509 states and 1658 transitions. Second operand has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:03:44,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:03:44,904 INFO L93 Difference]: Finished difference Result 1518 states and 1673 transitions. [2023-12-02 15:03:44,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 15:03:44,905 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 60 [2023-12-02 15:03:44,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:03:44,911 INFO L225 Difference]: With dead ends: 1518 [2023-12-02 15:03:44,911 INFO L226 Difference]: Without dead ends: 1518 [2023-12-02 15:03:44,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2023-12-02 15:03:44,912 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 6 mSDsluCounter, 2624 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3938 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 15:03:44,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3938 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 15:03:44,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2023-12-02 15:03:44,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1517. [2023-12-02 15:03:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 817 states have (on average 2.0134638922888617) internal successors, (1645), 1506 states have internal predecessors, (1645), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 15:03:44,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1671 transitions. [2023-12-02 15:03:44,940 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1671 transitions. Word has length 60 [2023-12-02 15:03:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:03:44,940 INFO L495 AbstractCegarLoop]: Abstraction has 1517 states and 1671 transitions. [2023-12-02 15:03:44,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.166666666666666) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 15:03:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1671 transitions. [2023-12-02 15:03:44,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-02 15:03:44,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:03:44,941 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:03:44,946 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:45,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (16)] Ended with exit code 0 [2023-12-02 15:03:45,349 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 15:03:45,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:45,542 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:03:45,542 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:03:45,543 INFO L85 PathProgramCache]: Analyzing trace with hash 593118864, now seen corresponding path program 2 times [2023-12-02 15:03:45,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:03:45,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1055070381] [2023-12-02 15:03:45,543 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:03:45,543 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 15:03:45,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:03:45,544 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:45,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:03:45,950 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:03:45,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:03:45,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:03:45,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:46,013 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 15:03:46,013 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:46,174 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 15:03:46,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:03:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1055070381] [2023-12-02 15:03:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1055070381] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1937878355] [2023-12-02 15:03:46,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:03:46,175 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:03:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:03:46,176 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:03:46,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-12-02 15:03:47,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:03:47,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:03:47,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 15:03:47,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:03:47,378 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 15:03:47,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:03:47,428 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 15:03:47,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1937878355] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:03:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895607882] [2023-12-02 15:03:47,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:03:47,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:03:47,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:03:47,430 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:03:47,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 15:04:00,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:04:00,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:04:00,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 15:04:00,147 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:00,248 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:04:00,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 15:04:00,275 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 15:04:00,529 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:04:00,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:04:00,600 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 15:04:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 15:04:00,636 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:00,754 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 15:04:00,755 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 15:04:00,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895607882] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:04:00,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 15:04:00,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 11] total 24 [2023-12-02 15:04:00,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854213883] [2023-12-02 15:04:00,869 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:00,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 15:04:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:04:00,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 15:04:00,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=551, Unknown=8, NotChecked=0, Total=650 [2023-12-02 15:04:00,871 INFO L87 Difference]: Start difference. First operand 1517 states and 1671 transitions. Second operand has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:04:18,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:18,992 INFO L93 Difference]: Finished difference Result 1785 states and 1936 transitions. [2023-12-02 15:04:18,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-02 15:04:18,993 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 63 [2023-12-02 15:04:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:19,000 INFO L225 Difference]: With dead ends: 1785 [2023-12-02 15:04:19,000 INFO L226 Difference]: Without dead ends: 1783 [2023-12-02 15:04:19,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=458, Invalid=2501, Unknown=11, NotChecked=0, Total=2970 [2023-12-02 15:04:19,002 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 1076 mSDsluCounter, 11410 mSDsCounter, 0 mSdLazyCounter, 11086 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 12263 SdHoareTripleChecker+Invalid, 11155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 11086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:19,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1096 Valid, 12263 Invalid, 11155 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [69 Valid, 11086 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2023-12-02 15:04:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2023-12-02 15:04:19,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1525. [2023-12-02 15:04:19,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 826 states have (on average 2.0048426150121066) internal successors, (1656), 1514 states have internal predecessors, (1656), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 15:04:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1682 transitions. [2023-12-02 15:04:19,023 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1682 transitions. Word has length 63 [2023-12-02 15:04:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:19,023 INFO L495 AbstractCegarLoop]: Abstraction has 1525 states and 1682 transitions. [2023-12-02 15:04:19,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.666666666666667) internal successors, (119), 23 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:04:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1682 transitions. [2023-12-02 15:04:19,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-12-02 15:04:19,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:19,024 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:04:19,030 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:04:19,241 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-12-02 15:04:19,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-12-02 15:04:19,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:04:19,625 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:04:19,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1836350161, now seen corresponding path program 1 times [2023-12-02 15:04:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:04:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513333248] [2023-12-02 15:04:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:19,626 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 15:04:19,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:04:19,627 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:04:19,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:04:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:19,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:04:19,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:20,024 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 15:04:20,024 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:20,501 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 15:04:20,501 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:04:20,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513333248] [2023-12-02 15:04:20,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [513333248] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:20,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1626638207] [2023-12-02 15:04:20,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:20,502 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:04:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:04:20,503 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:04:20,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-12-02 15:04:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:21,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-02 15:04:21,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:21,098 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 15:04:21,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:21,195 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 15:04:21,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1626638207] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:21,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678411207] [2023-12-02 15:04:21,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:04:21,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:21,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:04:21,197 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:04:21,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 15:04:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:04:21,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-02 15:04:21,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:21,593 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 15:04:21,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:22,237 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 15:04:22,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678411207] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:22,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 15:04:22,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 14, 14] total 38 [2023-12-02 15:04:22,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211883540] [2023-12-02 15:04:22,238 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:22,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 15:04:22,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:04:22,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 15:04:22,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=959, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 15:04:22,240 INFO L87 Difference]: Start difference. First operand 1525 states and 1682 transitions. Second operand has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:04:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:04:31,393 INFO L93 Difference]: Finished difference Result 1555 states and 1736 transitions. [2023-12-02 15:04:31,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 15:04:31,393 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 69 [2023-12-02 15:04:31,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:04:31,398 INFO L225 Difference]: With dead ends: 1555 [2023-12-02 15:04:31,398 INFO L226 Difference]: Without dead ends: 1552 [2023-12-02 15:04:31,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1628, Invalid=3342, Unknown=0, NotChecked=0, Total=4970 [2023-12-02 15:04:31,401 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 25 mSDsluCounter, 18316 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19627 SdHoareTripleChecker+Invalid, 3481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:04:31,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19627 Invalid, 3481 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [65 Valid, 3416 Invalid, 0 Unknown, 0 Unchecked, 7.8s Time] [2023-12-02 15:04:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2023-12-02 15:04:31,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1543. [2023-12-02 15:04:31,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1543 states, 844 states have (on average 1.9893364928909953) internal successors, (1679), 1532 states have internal predecessors, (1679), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 15:04:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1543 states to 1543 states and 1705 transitions. [2023-12-02 15:04:31,431 INFO L78 Accepts]: Start accepts. Automaton has 1543 states and 1705 transitions. Word has length 69 [2023-12-02 15:04:31,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:04:31,432 INFO L495 AbstractCegarLoop]: Abstraction has 1543 states and 1705 transitions. [2023-12-02 15:04:31,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 35 states have (on average 2.6285714285714286) internal successors, (92), 38 states have internal predecessors, (92), 1 states have call successors, (1), 1 states have call predecessors, (1), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-02 15:04:31,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 1705 transitions. [2023-12-02 15:04:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-12-02 15:04:31,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:04:31,434 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:04:31,439 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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)] Forceful destruction successful, exit code 0 [2023-12-02 15:04:31,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-12-02 15:04:31,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-12-02 15:04:32,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:04:32,035 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:04:32,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:04:32,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1792299857, now seen corresponding path program 2 times [2023-12-02 15:04:32,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:04:32,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210531308] [2023-12-02 15:04:32,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:04:32,036 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 15:04:32,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:04:32,037 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:04:32,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:04:32,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:04:32,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:04:32,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 15:04:32,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:33,161 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 15:04:33,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:35,202 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 15:04:35,203 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:04:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210531308] [2023-12-02 15:04:35,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210531308] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:35,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1907413029] [2023-12-02 15:04:35,203 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:04:35,203 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:04:35,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:04:35,204 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:04:35,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-12-02 15:04:36,692 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:04:36,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:04:36,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 15:04:36,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:36,805 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 15:04:36,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:37,319 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 15:04:37,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1907413029] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 15:04:37,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196145908] [2023-12-02 15:04:37,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 15:04:37,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:04:37,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:04:37,321 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:04:37,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 15:04:47,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 15:04:47,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 15:04:47,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 65 conjunts are in the unsatisfiable core [2023-12-02 15:04:47,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:04:47,958 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 15:04:47,968 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:04:47,968 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 15:04:48,062 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 15:04:48,067 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 15:04:48,414 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 15:04:48,419 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 15:04:48,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:04:48,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 15:04:48,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 30 treesize of output 13 [2023-12-02 15:04:49,156 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 15:04:49,163 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 15:04:49,252 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2023-12-02 15:04:49,252 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:04:50,156 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_2509 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2510 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2510) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2509) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:04:50,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196145908] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:04:50,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 15:04:50,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 9] total 58 [2023-12-02 15:04:50,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571714808] [2023-12-02 15:04:50,164 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 15:04:50,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-02 15:04:50,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:04:50,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-02 15:04:50,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=699, Invalid=2844, Unknown=1, NotChecked=116, Total=3660 [2023-12-02 15:04:50,167 INFO L87 Difference]: Start difference. First operand 1543 states and 1705 transitions. Second operand has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:05:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:05:55,427 INFO L93 Difference]: Finished difference Result 1910 states and 2155 transitions. [2023-12-02 15:05:55,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2023-12-02 15:05:55,428 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 81 [2023-12-02 15:05:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:05:55,432 INFO L225 Difference]: With dead ends: 1910 [2023-12-02 15:05:55,432 INFO L226 Difference]: Without dead ends: 1901 [2023-12-02 15:05:55,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 163 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 7047 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=5889, Invalid=20846, Unknown=1, NotChecked=324, Total=27060 [2023-12-02 15:05:55,442 INFO L413 NwaCegarLoop]: 860 mSDtfsCounter, 1112 mSDsluCounter, 23552 mSDsCounter, 0 mSdLazyCounter, 24795 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 24412 SdHoareTripleChecker+Invalid, 24935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 24795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:05:55,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 24412 Invalid, 24935 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [140 Valid, 24795 Invalid, 0 Unknown, 0 Unchecked, 46.8s Time] [2023-12-02 15:05:55,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2023-12-02 15:05:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1627. [2023-12-02 15:05:55,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 928 states have (on average 1.9137931034482758) internal successors, (1776), 1615 states have internal predecessors, (1776), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 15:05:55,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 1802 transitions. [2023-12-02 15:05:55,500 INFO L78 Accepts]: Start accepts. Automaton has 1627 states and 1802 transitions. Word has length 81 [2023-12-02 15:05:55,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:05:55,500 INFO L495 AbstractCegarLoop]: Abstraction has 1627 states and 1802 transitions. [2023-12-02 15:05:55,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 55 states have (on average 2.8181818181818183) internal successors, (155), 58 states have internal predecessors, (155), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-02 15:05:55,501 INFO L276 IsEmpty]: Start isEmpty. Operand 1627 states and 1802 transitions. [2023-12-02 15:05:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 15:05:55,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:05:55,502 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:05:55,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:05:55,709 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (25)] Ended with exit code 0 [2023-12-02 15:05:55,920 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2023-12-02 15:05:56,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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,25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:05:56,103 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:05:56,104 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:05:56,104 INFO L85 PathProgramCache]: Analyzing trace with hash 681997108, now seen corresponding path program 1 times [2023-12-02 15:05:56,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:05:56,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429454633] [2023-12-02 15:05:56,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:56,105 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 15:05:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:05:56,106 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:05:56,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:05:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:05:56,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 15:05:56,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:05:56,863 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 15:05:56,974 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:05:56,975 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 15:05:57,026 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 15:05:57,118 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 15:05:58,060 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:05:58,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:05:58,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:05:58,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:05:58,180 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 15:05:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:05:58,214 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:05:58,260 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_2919) |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 15:05:58,269 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (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_2919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:05:58,623 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2919 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2965 (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~mem33#1.base| v_ArrVal_2965))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2919)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:05:58,625 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:05:58,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429454633] [2023-12-02 15:05:58,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429454633] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:05:58,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [783996808] [2023-12-02 15:05:58,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:05:58,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:05:58,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:05:58,627 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:05:58,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-12-02 15:06:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:02,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:06:02,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:02,432 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 15:06:02,666 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:06:02,666 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 15:06:02,730 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 15:06:02,862 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 15:06:03,736 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:06:03,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:03,883 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:06:03,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:03,894 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 15:06:03,901 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:06:03,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:03,913 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3374) |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 15:06:03,923 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3374 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_3374) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 15:06:04,292 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3374 (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~mem33#1.base| v_ArrVal_3420))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3374)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:06:04,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [783996808] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:04,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597838396] [2023-12-02 15:06:04,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:04,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:04,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:04,295 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:04,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 15:06:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:04,843 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 15:06:04,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:04,946 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:06:04,947 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 15:06:04,981 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 15:06:05,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:06:05,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:05,682 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:06:05,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:05,694 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 15:06:05,698 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:06:05,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:05,713 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_3827) |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 15:06:06,224 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 15:06:06,224 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 15:06:06,234 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3873 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3827 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem33#1.base| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_3873))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_3827)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 15:06:06,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597838396] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:06,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:06:06,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 23 [2023-12-02 15:06:06,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938863437] [2023-12-02 15:06:06,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:06:06,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-02 15:06:06,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:06:06,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-02 15:06:06,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=538, Unknown=12, NotChecked=440, Total=1122 [2023-12-02 15:06:06,238 INFO L87 Difference]: Start difference. First operand 1627 states and 1802 transitions. Second operand has 24 states, 20 states have (on average 6.65) internal successors, (133), 23 states have internal predecessors, (133), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:06:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:06:23,942 INFO L93 Difference]: Finished difference Result 2377 states and 2585 transitions. [2023-12-02 15:06:23,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:06:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 6.65) internal successors, (133), 23 states have internal predecessors, (133), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 105 [2023-12-02 15:06:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:06:23,947 INFO L225 Difference]: With dead ends: 2377 [2023-12-02 15:06:23,947 INFO L226 Difference]: Without dead ends: 2377 [2023-12-02 15:06:23,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 295 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=676, Unknown=12, NotChecked=488, Total=1332 [2023-12-02 15:06:23,948 INFO L413 NwaCegarLoop]: 852 mSDtfsCounter, 1539 mSDsluCounter, 8302 mSDsCounter, 0 mSdLazyCounter, 9756 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 9154 SdHoareTripleChecker+Invalid, 9795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 9756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2023-12-02 15:06:23,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 9154 Invalid, 9795 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [39 Valid, 9756 Invalid, 0 Unknown, 0 Unchecked, 17.4s Time] [2023-12-02 15:06:23,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2023-12-02 15:06:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1626. [2023-12-02 15:06:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1626 states, 928 states have (on average 1.9127155172413792) internal successors, (1775), 1614 states have internal predecessors, (1775), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 7 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-02 15:06:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 1801 transitions. [2023-12-02 15:06:23,980 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 1801 transitions. Word has length 105 [2023-12-02 15:06:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:06:23,980 INFO L495 AbstractCegarLoop]: Abstraction has 1626 states and 1801 transitions. [2023-12-02 15:06:23,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 6.65) internal successors, (133), 23 states have internal predecessors, (133), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:06:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 1801 transitions. [2023-12-02 15:06:23,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-02 15:06:23,981 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:06:23,982 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:06:24,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 15:06:24,196 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:06:24,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-12-02 15:06:24,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:06:24,583 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:06:24,583 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:06:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash 681997109, now seen corresponding path program 1 times [2023-12-02 15:06:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:06:24,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813347971] [2023-12-02 15:06:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:24,584 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 15:06:24,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:06:24,585 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:06:24,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:06:25,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:25,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 15:06:25,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:25,590 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 15:06:25,705 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:06:25,705 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 15:06:25,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:06:25,738 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 15:06:25,750 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 15:06:25,869 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 15:06:25,874 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 15:06:26,624 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:06:26,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:26,631 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 15:06:26,777 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:06:26,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:26,796 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 15:06:26,822 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 15:06:26,829 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 15:06:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:06:26,860 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:27,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_4328) |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 15:06:27,084 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_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:06:28,301 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4420) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4421) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_4329 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4328 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4421 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4420 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4421))) (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~mem33#1.base| v_ArrVal_4420) .cse2 v_ArrVal_4328) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_4329) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:06:28,311 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:06:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813347971] [2023-12-02 15:06:28,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813347971] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:28,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1124882222] [2023-12-02 15:06:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:28,311 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:06:28,311 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:06:28,312 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:06:28,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-12-02 15:06:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:33,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 73 conjunts are in the unsatisfiable core [2023-12-02 15:06:33,067 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:33,072 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 15:06:33,079 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 15:06:33,461 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-12-02 15:06:33,461 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 13 [2023-12-02 15:06:33,484 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:06:33,484 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 15:06:33,538 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 15:06:33,547 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 15:06:33,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-12-02 15:06:33,673 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 15:06:34,067 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 15:06:34,245 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 48 treesize of output 34 [2023-12-02 15:06:34,258 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 15:06:34,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:34,372 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 15:06:34,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 15:06:34,380 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 15:06:34,456 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:06:34,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:34,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 239 treesize of output 167 [2023-12-02 15:06:39,573 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4880) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse0 (select .cse1 .cse2))) (or (not (= (bvadd (_ bv8 32) .cse0) |c_ULTIMATE.start_main_~user~0#1.offset|)) (bvule (bvadd (_ bv8 32) (select (store .cse1 (bvadd (_ bv16 32) .cse0) .cse2) .cse2)) .cse3) (not (bvule (bvadd .cse0 (_ bv20 32)) .cse3)))))) (forall ((v_arrayElimCell_61 (_ BitVec 32)) (v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4880))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (let ((.cse4 (select (select (store .cse5 v_arrayElimCell_61 (store (select .cse5 v_arrayElimCell_61) (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_61))))))) (forall ((v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4880))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (bvadd (_ bv8 32) .cse7) |c_ULTIMATE.start_main_~user~0#1.offset|) (forall ((v_arrayElimCell_61 (_ BitVec 32))) (let ((.cse8 (select |c_#length| v_arrayElimCell_61))) (or (not (bvule (bvadd .cse7 (_ bv20 32)) .cse8)) (bvule (bvadd (select (select (store .cse9 v_arrayElimCell_61 (store (select .cse9 v_arrayElimCell_61) (bvadd (_ bv16 32) .cse7) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse8)))))))) (forall ((v_arrayElimCell_61 (_ BitVec 32)) (v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4880))) (let ((.cse10 (select (select .cse13 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse11 (select |c_#length| v_arrayElimCell_61)) (.cse12 (bvadd (select (select (store .cse13 v_arrayElimCell_61 (store (select .cse13 v_arrayElimCell_61) (bvadd (_ bv16 32) .cse10) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)))) (or (not (bvule (bvadd .cse10 (_ bv20 32)) .cse11)) (bvule .cse12 .cse11) (bvule .cse12 .cse3)))))) (forall ((v_arrayElimCell_61 (_ BitVec 32)) (v_ArrVal_4880 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_4880))) (let ((.cse14 (select (select .cse16 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (.cse15 (select |c_#length| v_arrayElimCell_61))) (or (not (bvule (bvadd .cse14 (_ bv20 32)) .cse15)) (bvule (bvadd (select (select (store .cse16 v_arrayElimCell_61 (store (select .cse16 v_arrayElimCell_61) (bvadd (_ bv16 32) .cse14) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) .cse15) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_61))))))) is different from false [2023-12-02 15:06:40,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1124882222] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:40,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467532308] [2023-12-02 15:06:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:06:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:06:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:06:40,111 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:06:40,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 15:06:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:06:40,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 15:06:40,774 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:06:40,965 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:06:40,965 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 15:06:40,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:06:40,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:06:41,016 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 15:06:41,100 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 15:06:41,108 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 15:06:42,103 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:06:42,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:42,117 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 15:06:42,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:06:42,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:06:42,240 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 15:06:42,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 15:06:42,301 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 15:06:42,308 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:06:42,308 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:06:42,380 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5335) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_5335) |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 15:06:42,431 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_5334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5335) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5335) |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 15:06:44,088 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5426) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5427) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5335) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5426 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5427 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5334 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5335 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_5427))) (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~mem33#1.base| v_ArrVal_5426) .cse2 v_ArrVal_5335) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5334) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 15:06:44,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467532308] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:06:44,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:06:44,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 19 [2023-12-02 15:06:44,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073941835] [2023-12-02 15:06:44,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:06:44,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 15:06:44,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:06:44,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 15:06:44,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=491, Unknown=7, NotChecked=350, Total=930 [2023-12-02 15:06:44,100 INFO L87 Difference]: Start difference. First operand 1626 states and 1801 transitions. Second operand has 20 states, 17 states have (on average 7.294117647058823) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:07:31,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:07:31,131 INFO L93 Difference]: Finished difference Result 2460 states and 2691 transitions. [2023-12-02 15:07:31,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:07:31,132 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 7.294117647058823) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2023-12-02 15:07:31,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:07:31,138 INFO L225 Difference]: With dead ends: 2460 [2023-12-02 15:07:31,138 INFO L226 Difference]: Without dead ends: 2460 [2023-12-02 15:07:31,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=163, Invalid=850, Unknown=7, NotChecked=462, Total=1482 [2023-12-02 15:07:31,139 INFO L413 NwaCegarLoop]: 636 mSDtfsCounter, 2474 mSDsluCounter, 5717 mSDsCounter, 0 mSdLazyCounter, 14283 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 6353 SdHoareTripleChecker+Invalid, 14349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 14283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.7s IncrementalHoareTripleChecker+Time [2023-12-02 15:07:31,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 6353 Invalid, 14349 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [66 Valid, 14283 Invalid, 0 Unknown, 0 Unchecked, 45.7s Time] [2023-12-02 15:07:31,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2023-12-02 15:07:31,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1783. [2023-12-02 15:07:31,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1083 states have (on average 1.8873499538319483) internal successors, (2044), 1767 states have internal predecessors, (2044), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) [2023-12-02 15:07:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2077 transitions. [2023-12-02 15:07:31,170 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2077 transitions. Word has length 105 [2023-12-02 15:07:31,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:07:31,171 INFO L495 AbstractCegarLoop]: Abstraction has 1783 states and 2077 transitions. [2023-12-02 15:07:31,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 7.294117647058823) internal successors, (124), 20 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:07:31,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2077 transitions. [2023-12-02 15:07:31,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 15:07:31,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:07:31,172 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:07:31,186 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 15:07:31,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (31)] Ended with exit code 0 [2023-12-02 15:07:31,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:07:31,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:07:31,773 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:07:31,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:07:31,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1728280014, now seen corresponding path program 1 times [2023-12-02 15:07:31,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:07:31,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1797727847] [2023-12-02 15:07:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:07:31,774 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 15:07:31,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:07:31,775 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:07:31,776 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:07:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:07:32,772 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:07:32,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:07:32,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:07:32,988 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:07:32,988 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 15:07:33,037 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 15:07:33,176 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 15:07:34,441 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:07:34,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:07:34,612 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:07:34,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:07:34,733 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:07:34,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:07:34,751 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 15:07:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:07:34,811 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:07:34,916 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_5852) |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 15:07:34,934 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5852) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 15:07:34,955 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5852 (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~mem35#1.base| v_ArrVal_5851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5852)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:07:34,974 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5852 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5851))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5852)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:07:35,445 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5898 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5851 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5852 (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~mem33#1.base| v_ArrVal_5898))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5851)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5852)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:07:35,450 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:07:35,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1797727847] [2023-12-02 15:07:35,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1797727847] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:07:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [957026554] [2023-12-02 15:07:35,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:07:35,451 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:07:35,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:07:35,452 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:07:35,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2023-12-02 15:08:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:01,895 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 15:08:01,904 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:01,915 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 15:08:02,380 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:08:02,380 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 15:08:02,472 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 15:08:02,730 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 15:08:03,934 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:08:03,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:04,167 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:08:04,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:04,327 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:08:04,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:04,345 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 15:08:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:08:04,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:04,383 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_6323) |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 15:08:04,400 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6323 (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_6323) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:08:04,421 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (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~mem35#1.base| v_ArrVal_6322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:08:04,441 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (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_6322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:08:04,895 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6323 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6369 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (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~mem33#1.base| v_ArrVal_6369))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6322)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6323)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:08:04,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [957026554] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:04,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893647285] [2023-12-02 15:08:04,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:04,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:08:04,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:08:04,901 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:08:04,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-12-02 15:08:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:05,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 15:08:05,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:05,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:08:05,799 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:08:05,800 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 15:08:05,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 15:08:06,469 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:08:06,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:06,610 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:08:06,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:06,834 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:08:06,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:06,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 33 treesize of output 15 [2023-12-02 15:08:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:08:06,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:07,087 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6793 (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_6793) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:08:07,124 INFO L349 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-12-02 15:08:07,124 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 15:08:07,140 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_#t~mem35#1.base| (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~mem35#1.base| v_ArrVal_6792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6793)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2023-12-02 15:08:07,156 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6793 (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_6792))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_6793)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 15:08:07,624 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6839 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6792 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6793 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_6839)) (.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_6792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6793)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) .cse3)))) is different from false [2023-12-02 15:08:07,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893647285] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:07,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:08:07,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 25 [2023-12-02 15:08:07,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151544688] [2023-12-02 15:08:07,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:08:07,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 15:08:07,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:08:07,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 15:08:07,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=633, Unknown=19, NotChecked=910, Total=1722 [2023-12-02 15:08:07,631 INFO L87 Difference]: Start difference. First operand 1783 states and 2077 transitions. Second operand has 26 states, 22 states have (on average 6.181818181818182) internal successors, (136), 26 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:08:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:08:39,668 INFO L93 Difference]: Finished difference Result 2452 states and 2684 transitions. [2023-12-02 15:08:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 15:08:39,669 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 22 states have (on average 6.181818181818182) internal successors, (136), 26 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 107 [2023-12-02 15:08:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:08:39,673 INFO L225 Difference]: With dead ends: 2452 [2023-12-02 15:08:39,673 INFO L226 Difference]: Without dead ends: 2452 [2023-12-02 15:08:39,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 299 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=678, Unknown=19, NotChecked=938, Total=1806 [2023-12-02 15:08:39,674 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 2440 mSDsluCounter, 9522 mSDsCounter, 0 mSdLazyCounter, 10903 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 10375 SdHoareTripleChecker+Invalid, 10956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 10903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2023-12-02 15:08:39,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 10375 Invalid, 10956 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [53 Valid, 10903 Invalid, 0 Unknown, 0 Unchecked, 31.6s Time] [2023-12-02 15:08:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2023-12-02 15:08:39,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1782. [2023-12-02 15:08:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1782 states, 1083 states have (on average 1.886426592797784) internal successors, (2043), 1766 states have internal predecessors, (2043), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) [2023-12-02 15:08:39,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1782 states to 1782 states and 2076 transitions. [2023-12-02 15:08:39,698 INFO L78 Accepts]: Start accepts. Automaton has 1782 states and 2076 transitions. Word has length 107 [2023-12-02 15:08:39,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:08:39,699 INFO L495 AbstractCegarLoop]: Abstraction has 1782 states and 2076 transitions. [2023-12-02 15:08:39,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 22 states have (on average 6.181818181818182) internal successors, (136), 26 states have internal predecessors, (136), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:08:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1782 states and 2076 transitions. [2023-12-02 15:08:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-02 15:08:39,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:08:39,700 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:08:39,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2023-12-02 15:08:39,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2023-12-02 15:08:40,109 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:08:40,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:08:40,301 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:08:40,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:08:40,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1728280013, now seen corresponding path program 1 times [2023-12-02 15:08:40,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:08:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [606994924] [2023-12-02 15:08:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:40,303 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 15:08:40,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:08:40,303 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:08:40,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:08:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:08:41,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 15:08:41,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:08:41,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:08:41,537 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 15:08:41,559 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:08:41,560 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 15:08:41,601 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 15:08:41,618 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 15:08:41,763 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 15:08:41,770 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 15:08:42,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:08:42,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:42,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 30 treesize of output 13 [2023-12-02 15:08:42,967 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:08:42,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 62 treesize of output 57 [2023-12-02 15:08:42,985 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 15:08:43,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:08:43,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:08:43,116 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 15:08:43,143 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 15:08:43,150 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 15:08:43,204 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:08:43,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:08:43,424 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7312) |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~mem36#1.base| v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7312) |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 15:08:43,464 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_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 15:08:43,576 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7310))) (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~mem35#1.base| v_ArrVal_7309) .cse0 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7309) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7312) |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 15:08:43,697 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_7309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7310))) (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_7309) .cse1 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7309) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7312) |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 15:08:46,732 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7403))) (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~mem33#1.base| v_ArrVal_7404) .cse1 v_ArrVal_7309) (select (select (store .cse2 .cse1 v_ArrVal_7310) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7312))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7309 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7403 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7404 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7310 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7311 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7312 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7403))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_7310))) (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~mem33#1.base| v_ArrVal_7404) .cse4 v_ArrVal_7309) .cse5 v_ArrVal_7312) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_7311) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 15:08:46,751 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:08:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [606994924] [2023-12-02 15:08:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [606994924] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:08:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [265959185] [2023-12-02 15:08:46,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:08:46,751 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:08:46,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:08:46,752 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:08:46,753 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-12-02 15:09:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:12,339 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 120 conjunts are in the unsatisfiable core [2023-12-02 15:09:12,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:09:12,358 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 15:09:13,007 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 15:09:13,053 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:09:13,053 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 15:09:13,186 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 15:09:13,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 15:09:13,532 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 15:09:13,541 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 15:09:14,894 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:09:14,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:09:14,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 24 treesize of output 11 [2023-12-02 15:09:15,238 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 53 treesize of output 35 [2023-12-02 15:09:15,269 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 15:09:15,675 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2023-12-02 15:09:15,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 50 [2023-12-02 15:09:15,685 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 15:09:15,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2023-12-02 15:09:15,733 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 15:09:15,742 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 15:09:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:09:15,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:09:15,836 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7877) |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~mem36#1.base| v_ArrVal_7876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_7877) |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 15:09:15,886 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_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-12-02 15:09:15,955 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base|) (bvadd |c_ULTIMATE.start_main_#t~mem35#1.offset| (_ bv16 32)) |c_ULTIMATE.start_main_~user~0#1.base|))) (.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7875) .cse0 v_ArrVal_7877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_7875) .cse0 v_ArrVal_7877) |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 15:09:16,026 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))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 (store (select |c_#memory_$Pointer$.base| .cse0) (bvadd (_ bv16 32) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7875) .cse1 v_ArrVal_7877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7875) .cse1 v_ArrVal_7877) |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 15:09:19,973 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7969))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7968))) (store (store .cse1 .cse2 v_ArrVal_7875) (select (select (store .cse3 .cse2 (store (select .cse3 .cse2) (bvadd (_ bv16 32) (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |c_ULTIMATE.start_main_~user~0#1.base|)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7877))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7969 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7968 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7877 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7876 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7875 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7969))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) (.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_7968))) (let ((.cse8 (store .cse9 .cse6 (store (select .cse9 .cse6) (bvadd (_ bv16 32) (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store .cse5 .cse6 v_ArrVal_7875) .cse7 v_ArrVal_7877) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_7876) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))) is different from false [2023-12-02 15:09:20,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [265959185] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:09:20,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480730843] [2023-12-02 15:09:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:09:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:09:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:09:20,054 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:09:20,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-12-02 15:09:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:09:20,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 115 conjunts are in the unsatisfiable core [2023-12-02 15:09:20,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:09:20,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 15:09:21,280 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 15:09:21,345 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:09:21,345 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 15:09:21,377 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 15:09:21,431 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 15:09:21,586 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 15:09:21,600 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 15:09:24,050 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:09:24,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:09:24,092 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 15:09:24,342 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:09:24,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:09:24,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 15:09:24,526 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:09:24,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 15:09:24,553 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 15:09:24,595 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 15:09:24,609 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 15:09:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:09:24,632 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:09:24,752 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8441) |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~mem36#1.base| v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-12-02 15:09:24,821 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_8441 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 15:09:24,953 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8440))) (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~mem35#1.base| v_ArrVal_8439) .cse0 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8439) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8441) |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 15:09:25,117 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_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8440))) (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_8439) .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8439) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8441) |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 15:09:27,963 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8442 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8533))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8440))) (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~mem33#1.base| v_ArrVal_8534) .cse0 v_ArrVal_8439) .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8442) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8534 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8533 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_8533))) (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~mem33#1.base| v_ArrVal_8534) .cse6 v_ArrVal_8439) (select (select (store .cse7 .cse6 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8441))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv8 32)) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-12-02 15:09:27,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480730843] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:09:27,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:09:27,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 17 [2023-12-02 15:09:27,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540856108] [2023-12-02 15:09:27,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:09:27,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 15:09:27,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:09:27,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 15:09:27,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=329, Unknown=15, NotChecked=750, Total=1190 [2023-12-02 15:09:27,986 INFO L87 Difference]: Start difference. First operand 1782 states and 2076 transitions. Second operand has 18 states, 15 states have (on average 8.0) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:10:46,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:10:46,719 INFO L93 Difference]: Finished difference Result 2449 states and 2680 transitions. [2023-12-02 15:10:46,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 15:10:46,720 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-12-02 15:10:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:10:46,725 INFO L225 Difference]: With dead ends: 2449 [2023-12-02 15:10:46,726 INFO L226 Difference]: Without dead ends: 2449 [2023-12-02 15:10:46,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 304 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=160, Invalid=587, Unknown=15, NotChecked=960, Total=1722 [2023-12-02 15:10:46,727 INFO L413 NwaCegarLoop]: 863 mSDtfsCounter, 2442 mSDsluCounter, 4717 mSDsCounter, 0 mSdLazyCounter, 10573 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 72.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2460 SdHoareTripleChecker+Valid, 5580 SdHoareTripleChecker+Invalid, 10610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 10573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 77.3s IncrementalHoareTripleChecker+Time [2023-12-02 15:10:46,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2460 Valid, 5580 Invalid, 10610 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 10573 Invalid, 0 Unknown, 0 Unchecked, 77.3s Time] [2023-12-02 15:10:46,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2023-12-02 15:10:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 1781. [2023-12-02 15:10:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1083 states have (on average 1.8855032317636196) internal successors, (2042), 1765 states have internal predecessors, (2042), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) [2023-12-02 15:10:46,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2075 transitions. [2023-12-02 15:10:46,751 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2075 transitions. Word has length 107 [2023-12-02 15:10:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:10:46,752 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2075 transitions. [2023-12-02 15:10:46,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 8.0) internal successors, (120), 18 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-02 15:10:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2075 transitions. [2023-12-02 15:10:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 15:10:46,753 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:10:46,753 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:10:46,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:10:46,973 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-12-02 15:10:47,182 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-12-02 15:10:47,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:10:47,354 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:10:47,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:10:47,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1277741003, now seen corresponding path program 1 times [2023-12-02 15:10:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:10:47,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477826450] [2023-12-02 15:10:47,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:47,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 15:10:47,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:10:47,356 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:10:47,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:10:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:10:48,763 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 15:10:48,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:10:48,782 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 15:10:49,596 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:10:49,597 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 15:10:49,771 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 15:10:50,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-12-02 15:10:53,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:10:53,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:10:53,984 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:10:53,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:10:54,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:10:54,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:10:54,679 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:10:54,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:10:54,740 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 15:10:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:10:54,919 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:10:57,439 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8975 (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_8975) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-12-02 15:10:57,489 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8974 (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~mem36#1.base| v_ArrVal_8974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:10:57,539 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8974 (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_8974))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:10:57,596 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8973 (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~mem35#1.base| v_ArrVal_8973))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8974)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:10:57,654 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8974 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8973 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8973))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8974)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:10:59,011 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:10:59,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477826450] [2023-12-02 15:10:59,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477826450] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:10:59,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1282726856] [2023-12-02 15:10:59,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:10:59,012 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:10:59,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:10:59,013 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:10:59,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2023-12-02 15:12:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:12:24,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 15:12:24,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:12:24,374 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 15:12:25,750 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 15:12:25,751 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 15:12:26,049 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 15:12:26,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 20 treesize of output 12 [2023-12-02 15:12:29,651 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:12:29,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:12:30,285 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:12:30,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 15:12:30,719 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:12:30,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:12:31,181 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 15:12:31,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:12:31,231 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 15:12:31,271 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:12:31,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:12:33,563 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8975 (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~mem36#1.base| v_ArrVal_9461))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 15:12:33,611 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9461))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:12:33,662 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8975 (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~mem35#1.base| v_ArrVal_9460))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9461)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:12:33,715 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8975 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9460))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9461)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:12:34,698 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9461 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9460 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9508 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8975 (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~mem33#1.base| v_ArrVal_9508))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9460)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9461)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8975)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 15:12:34,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1282726856] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:12:34,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87536563] [2023-12-02 15:12:34,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:12:34,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 15:12:34,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 15:12:34,710 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 15:12:34,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2023-12-02 15:12:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:12:35,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 15:12:35,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:12:35,480 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 15:12:36,073 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:12:36,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 15:12:36,262 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 15:12:39,042 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:12:39,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:12:39,686 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:12:39,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:12:40,077 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:12:40,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 15:12:40,467 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:12:40,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:12:40,508 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 15:12:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:12:40,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:12:40,584 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_9948) |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 15:12:40,627 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9948) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:12:40,674 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (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~mem36#1.base| v_ArrVal_9947))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:12:40,721 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (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| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9947))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 15:12:40,771 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_9946))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9947)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 15:12:40,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9946 (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_9946))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9947)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 15:12:41,928 INFO L349 Elim1Store]: treesize reduction 7, result has 93.2 percent of original size [2023-12-02 15:12:41,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 108 [2023-12-02 15:12:41,966 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9948 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9947 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9994 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_9994))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9946)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9947)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9948)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem33#1.base|)) is different from false [2023-12-02 15:12:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87536563] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:12:41,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 15:12:41,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 29 [2023-12-02 15:12:41,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330047583] [2023-12-02 15:12:41,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 15:12:41,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 15:12:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 15:12:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 15:12:41,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=900, Unknown=28, NotChecked=1326, Total=2450 [2023-12-02 15:12:41,977 INFO L87 Difference]: Start difference. First operand 1781 states and 2075 transitions. Second operand has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 29 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:14:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 15:14:10,741 INFO L93 Difference]: Finished difference Result 2450 states and 2682 transitions. [2023-12-02 15:14:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 15:14:10,742 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 29 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 109 [2023-12-02 15:14:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 15:14:10,748 INFO L225 Difference]: With dead ends: 2450 [2023-12-02 15:14:10,748 INFO L226 Difference]: Without dead ends: 2450 [2023-12-02 15:14:10,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 302 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=219, Invalid=1081, Unknown=28, NotChecked=1428, Total=2756 [2023-12-02 15:14:10,750 INFO L413 NwaCegarLoop]: 850 mSDtfsCounter, 1528 mSDsluCounter, 9973 mSDsCounter, 0 mSdLazyCounter, 11994 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 10823 SdHoareTripleChecker+Invalid, 12032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 11994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 87.8s IncrementalHoareTripleChecker+Time [2023-12-02 15:14:10,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 10823 Invalid, 12032 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [38 Valid, 11994 Invalid, 0 Unknown, 0 Unchecked, 87.8s Time] [2023-12-02 15:14:10,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2023-12-02 15:14:10,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 1780. [2023-12-02 15:14:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1083 states have (on average 1.8845798707294552) internal successors, (2041), 1764 states have internal predecessors, (2041), 16 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (17), 9 states have call predecessors, (17), 14 states have call successors, (17) [2023-12-02 15:14:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2074 transitions. [2023-12-02 15:14:10,778 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2074 transitions. Word has length 109 [2023-12-02 15:14:10,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 15:14:10,778 INFO L495 AbstractCegarLoop]: Abstraction has 1780 states and 2074 transitions. [2023-12-02 15:14:10,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.461538461538462) internal successors, (142), 29 states have internal predecessors, (142), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 15:14:10,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2074 transitions. [2023-12-02 15:14:10,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-02 15:14:10,780 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 15:14:10,780 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 15:14:10,803 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2023-12-02 15:14:10,993 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:14:11,215 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2023-12-02 15:14:11,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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,40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 15:14:11,381 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 928 more)] === [2023-12-02 15:14:11,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 15:14:11,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1277741004, now seen corresponding path program 1 times [2023-12-02 15:14:11,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 15:14:11,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1903804355] [2023-12-02 15:14:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:14:11,382 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 15:14:11,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 15:14:11,383 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:14:11,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/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 15:14:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 15:14:12,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 118 conjunts are in the unsatisfiable core [2023-12-02 15:14:13,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 15:14:13,021 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 15:14:13,737 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 15:14:13,737 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 15:14:13,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 15:14:13,883 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 15:14:13,914 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 15:14:14,314 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 15:14:14,331 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 15:14:17,226 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:14:17,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:14:17,267 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 15:14:17,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:14:17,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:14:17,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 15:14:17,994 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:14:17,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:14:18,011 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 15:14:18,354 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 15:14:18,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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 15:14:18,383 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 15:14:18,429 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 15:14:18,456 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 15:14:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 15:14:18,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 15:14:19,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10484) |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~mem37#1.base| v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem37#1.base| v_ArrVal_10484) |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 15:14:19,114 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_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-12-02 15:14:19,207 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10482))) (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~mem36#1.base| v_ArrVal_10481) .cse0 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10481) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem36#1.base| v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv20 32)) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-12-02 15:14:19,310 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_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10482))) (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_10481) .cse1 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10481) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))))) is different from false [2023-12-02 15:14:19,789 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10480))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10482))) (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~mem35#1.base| v_ArrVal_10479) .cse0 v_ArrVal_10481) .cse1 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem35#1.base| v_ArrVal_10480))) (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~mem35#1.base| v_ArrVal_10479) .cse6 v_ArrVal_10481) (select (select (store .cse7 .cse6 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10484))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-12-02 15:14:21,267 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_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10480))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10479) .cse2 v_ArrVal_10481) (select (select (store .cse3 .cse2 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10484))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10480))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10482))) (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_10479) .cse5 v_ArrVal_10481) .cse6 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 15:14:26,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10483 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10576))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10480))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10482))) (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~mem33#1.base| v_ArrVal_10575) .cse0 v_ArrVal_10479) .cse1 v_ArrVal_10481) .cse2 v_ArrVal_10484) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10484 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10481 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10482 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10575 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10576 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10480 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_10576))) (let ((.cse8 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse10 (store .cse11 .cse8 v_ArrVal_10480))) (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~mem33#1.base| v_ArrVal_10575) .cse8 v_ArrVal_10479) .cse9 v_ArrVal_10481) (select (select (store .cse10 .cse9 v_ArrVal_10482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10484))))) |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 15:14:26,189 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 15:14:26,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1903804355] [2023-12-02 15:14:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1903804355] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 15:14:26,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1247077350] [2023-12-02 15:14:26,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 15:14:26,190 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 15:14:26,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 15:14:26,191 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 15:14:26,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0f611c9-54e5-4eab-89a8-7654032108be/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process