./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:42:43,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:42:43,590 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 18:42:43,595 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:42:43,596 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:42:43,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:42:43,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:42:43,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:42:43,626 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:42:43,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:42:43,627 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:42:43,628 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:42:43,628 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:42:43,629 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 18:42:43,629 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:42:43,630 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:42:43,630 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 18:42:43,631 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 18:42:43,631 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:42:43,632 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 18:42:43,632 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 18:42:43,633 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 18:42:43,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:42:43,634 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:42:43,635 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:42:43,635 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:42:43,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:42:43,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:42:43,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:42:43,637 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:42:43,637 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:42:43,637 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:42:43,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:42:43,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:42:43,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:42:43,639 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:42:43,639 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:42:43,639 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:42:43,639 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:42:43,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:42:43,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:42:43,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:42:43,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:42:43,641 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 18:42:43,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 18:42:43,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:42:43,641 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:42:43,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:42:43,642 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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2023-12-02 18:42:43,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:42:43,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:42:43,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:42:43,929 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:42:43,930 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:42:43,931 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2023-12-02 18:42:46,793 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:42:47,134 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:42:47,135 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2023-12-02 18:42:47,154 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data/cc56bcdaf/b62db8e287e24ce68daab321d24bb8fa/FLAGa7dfeae56 [2023-12-02 18:42:47,170 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data/cc56bcdaf/b62db8e287e24ce68daab321d24bb8fa [2023-12-02 18:42:47,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:42:47,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:42:47,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:42:47,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:42:47,181 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:42:47,182 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:42:47" (1/1) ... [2023-12-02 18:42:47,183 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595f77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:47, skipping insertion in model container [2023-12-02 18:42:47,183 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:42:47" (1/1) ... [2023-12-02 18:42:47,249 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:42:47,881 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:42:47,894 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 18:42:47,895 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@14a2f730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:47, skipping insertion in model container [2023-12-02 18:42:47,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:42:47,895 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-12-02 18:42:47,897 INFO L158 Benchmark]: Toolchain (without parser) took 722.36ms. Allocated memory is still 157.3MB. Free memory was 127.7MB in the beginning and 98.5MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-12-02 18:42:47,898 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 119.5MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 18:42:47,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 719.85ms. Allocated memory is still 157.3MB. Free memory was 127.3MB in the beginning and 98.5MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-12-02 18:42:47,900 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 119.5MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 719.85ms. Allocated memory is still 157.3MB. Free memory was 127.3MB in the beginning and 98.5MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 18:42:49,752 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 18:42:49,838 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-12-02 18:42:49,844 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 18:42:49,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 18:42:49,876 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 18:42:49,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 18:42:49,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 18:42:49,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 18:42:49,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 18:42:49,879 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 18:42:49,879 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 18:42:49,880 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 18:42:49,881 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 18:42:49,881 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 18:42:49,882 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 18:42:49,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 18:42:49,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 18:42:49,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 18:42:49,884 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 18:42:49,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 18:42:49,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 18:42:49,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 18:42:49,886 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 18:42:49,886 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 18:42:49,887 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 18:42:49,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 18:42:49,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 18:42:49,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-02 18:42:49,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-02 18:42:49,889 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 18:42:49,889 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 18:42:49,889 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 18:42:49,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 18:42:49,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 18:42:49,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 18:42:49,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 18:42:49,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:42:49,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 18:42:49,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 18:42:49,891 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-12-02 18:42:49,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-02 18:42:49,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 18:42:49,892 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 18:42:49,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 18:42:49,893 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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 -> 85fe539c4a9811cd5d49f239f4680cc0b3752a2958e9f287c34e302b923af4f9 [2023-12-02 18:42:50,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 18:42:50,227 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 18:42:50,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 18:42:50,232 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 18:42:50,232 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 18:42:50,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2023-12-02 18:42:53,114 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 18:42:53,424 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 18:42:53,424 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test10-1.i [2023-12-02 18:42:53,445 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data/4abddad84/7257907c3ef744c3b05c9d023361a421/FLAGcc4954b8c [2023-12-02 18:42:53,460 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/data/4abddad84/7257907c3ef744c3b05c9d023361a421 [2023-12-02 18:42:53,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 18:42:53,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 18:42:53,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 18:42:53,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 18:42:53,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 18:42:53,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:42:53" (1/1) ... [2023-12-02 18:42:53,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8f5b016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:53, skipping insertion in model container [2023-12-02 18:42:53,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:42:53" (1/1) ... [2023-12-02 18:42:53,545 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:42:54,243 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:42:54,258 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-02 18:42:54,273 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 18:42:54,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:42:54,381 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 18:42:54,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 18:42:54,500 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-12-02 18:42:54,506 INFO L206 MainTranslator]: Completed translation [2023-12-02 18:42:54,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54 WrapperNode [2023-12-02 18:42:54,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 18:42:54,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 18:42:54,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 18:42:54,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 18:42:54,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,661 INFO L138 Inliner]: procedures = 180, calls = 525, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2203 [2023-12-02 18:42:54,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 18:42:54,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 18:42:54,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 18:42:54,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 18:42:54,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,755 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,774 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,782 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 18:42:54,806 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 18:42:54,806 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 18:42:54,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 18:42:54,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (1/1) ... [2023-12-02 18:42:54,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 18:42:54,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:42:54,837 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 18:42:54,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 18:42:54,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-12-02 18:42:54,876 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2023-12-02 18:42:54,876 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2023-12-02 18:42:54,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-12-02 18:42:54,877 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-02 18:42:54,877 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-02 18:42:54,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-12-02 18:42:54,877 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-12-02 18:42:54,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 18:42:54,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 18:42:54,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 18:42:54,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 18:42:54,878 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-12-02 18:42:54,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 18:42:54,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 18:42:54,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-12-02 18:42:54,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-12-02 18:42:54,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 18:42:54,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 18:42:55,128 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 18:42:55,130 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 18:42:55,135 WARN L821 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2023-12-02 18:43:03,996 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 18:43:04,304 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 18:43:04,305 INFO L309 CfgBuilder]: Removed 151 assume(true) statements. [2023-12-02 18:43:04,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:43:04 BoogieIcfgContainer [2023-12-02 18:43:04,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 18:43:04,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 18:43:04,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 18:43:04,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 18:43:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:42:53" (1/3) ... [2023-12-02 18:43:04,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45855a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:43:04, skipping insertion in model container [2023-12-02 18:43:04,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:42:54" (2/3) ... [2023-12-02 18:43:04,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45855a4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:43:04, skipping insertion in model container [2023-12-02 18:43:04,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:43:04" (3/3) ... [2023-12-02 18:43:04,315 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test10-1.i [2023-12-02 18:43:04,330 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 18:43:04,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 990 error locations. [2023-12-02 18:43:04,404 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 18:43:04,409 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;@34190981, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 18:43:04,409 INFO L358 AbstractCegarLoop]: Starting to check reachability of 990 error locations. [2023-12-02 18:43:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 1873 states, 871 states have (on average 2.4615384615384617) internal successors, (2144), 1859 states have internal predecessors, (2144), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-02 18:43:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 18:43:04,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:04,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 18:43:04,427 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:04,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:04,433 INFO L85 PathProgramCache]: Analyzing trace with hash 109812, now seen corresponding path program 1 times [2023-12-02 18:43:04,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:04,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054795509] [2023-12-02 18:43:04,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:04,446 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 18:43:04,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:04,448 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:04,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:04,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:43:04,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:04,726 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 18:43:04,740 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 18:43:04,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:04,741 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054795509] [2023-12-02 18:43:04,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054795509] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:04,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:04,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 18:43:04,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691616338] [2023-12-02 18:43:04,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:04,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:04,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:04,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:04,789 INFO L87 Difference]: Start difference. First operand has 1873 states, 871 states have (on average 2.4615384615384617) internal successors, (2144), 1859 states have internal predecessors, (2144), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:09,065 INFO L93 Difference]: Finished difference Result 2324 states and 2487 transitions. [2023-12-02 18:43:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:09,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 18:43:09,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:09,090 INFO L225 Difference]: With dead ends: 2324 [2023-12-02 18:43:09,090 INFO L226 Difference]: Without dead ends: 2323 [2023-12-02 18:43:09,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:09,096 INFO L413 NwaCegarLoop]: 1065 mSDtfsCounter, 1779 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 1374 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-02 18:43:09,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2023-12-02 18:43:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 1986. [2023-12-02 18:43:09,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1986 states, 1008 states have (on average 2.257936507936508) internal successors, (2276), 1970 states have internal predecessors, (2276), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-02 18:43:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1986 states to 1986 states and 2308 transitions. [2023-12-02 18:43:09,207 INFO L78 Accepts]: Start accepts. Automaton has 1986 states and 2308 transitions. Word has length 2 [2023-12-02 18:43:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:09,207 INFO L495 AbstractCegarLoop]: Abstraction has 1986 states and 2308 transitions. [2023-12-02 18:43:09,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:09,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1986 states and 2308 transitions. [2023-12-02 18:43:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-12-02 18:43:09,208 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:09,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-12-02 18:43:09,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:09,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:09,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:09,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:09,412 INFO L85 PathProgramCache]: Analyzing trace with hash 109813, now seen corresponding path program 1 times [2023-12-02 18:43:09,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:09,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273022651] [2023-12-02 18:43:09,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:09,413 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 18:43:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:09,414 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:09,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:09,542 INFO L262 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:43:09,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:09,557 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 18:43:09,568 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 18:43:09,569 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:09,569 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273022651] [2023-12-02 18:43:09,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273022651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:09,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:09,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 18:43:09,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209021970] [2023-12-02 18:43:09,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:09,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:09,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:09,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:09,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:09,573 INFO L87 Difference]: Start difference. First operand 1986 states and 2308 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:16,014 INFO L93 Difference]: Finished difference Result 2689 states and 3092 transitions. [2023-12-02 18:43:16,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:16,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-12-02 18:43:16,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:16,031 INFO L225 Difference]: With dead ends: 2689 [2023-12-02 18:43:16,031 INFO L226 Difference]: Without dead ends: 2689 [2023-12-02 18:43:16,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:16,033 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 776 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:16,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 2512 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-12-02 18:43:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2689 states. [2023-12-02 18:43:16,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2689 to 2367. [2023-12-02 18:43:16,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 1387 states have (on average 2.1997116077865897) internal successors, (3051), 2348 states have internal predecessors, (3051), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-02 18:43:16,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 3089 transitions. [2023-12-02 18:43:16,103 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 3089 transitions. Word has length 2 [2023-12-02 18:43:16,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:16,103 INFO L495 AbstractCegarLoop]: Abstraction has 2367 states and 3089 transitions. [2023-12-02 18:43:16,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 3089 transitions. [2023-12-02 18:43:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-02 18:43:16,104 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:16,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-02 18:43:16,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:16,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:16,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:16,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:16,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1665027394, now seen corresponding path program 1 times [2023-12-02 18:43:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025395140] [2023-12-02 18:43:16,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:16,309 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 18:43:16,309 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:16,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:16,313 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:16,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:43:16,503 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:16,514 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 18:43:16,519 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 18:43:16,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:43:16,580 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 18:43:16,602 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:43:16,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-12-02 18:43:16,625 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 18:43:16,625 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:16,626 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:16,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025395140] [2023-12-02 18:43:16,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025395140] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:16,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:16,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:43:16,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006914127] [2023-12-02 18:43:16,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:16,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:43:16,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:16,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:43:16,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:16,629 INFO L87 Difference]: Start difference. First operand 2367 states and 3089 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:28,770 INFO L93 Difference]: Finished difference Result 4416 states and 5288 transitions. [2023-12-02 18:43:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:43:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-02 18:43:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:28,788 INFO L225 Difference]: With dead ends: 4416 [2023-12-02 18:43:28,788 INFO L226 Difference]: Without dead ends: 4416 [2023-12-02 18:43:28,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:28,790 INFO L413 NwaCegarLoop]: 577 mSDtfsCounter, 2164 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 3856 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 3880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 3856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:28,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2074 Invalid, 3880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 3856 Invalid, 0 Unknown, 0 Unchecked, 12.0s Time] [2023-12-02 18:43:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4416 states. [2023-12-02 18:43:28,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4416 to 2949. [2023-12-02 18:43:28,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2949 states, 1969 states have (on average 2.254443880142204) internal successors, (4439), 2924 states have internal predecessors, (4439), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4489 transitions. [2023-12-02 18:43:28,880 INFO L78 Accepts]: Start accepts. Automaton has 2949 states and 4489 transitions. Word has length 6 [2023-12-02 18:43:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:28,881 INFO L495 AbstractCegarLoop]: Abstraction has 2949 states and 4489 transitions. [2023-12-02 18:43:28,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:28,881 INFO L276 IsEmpty]: Start isEmpty. Operand 2949 states and 4489 transitions. [2023-12-02 18:43:28,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 18:43:28,882 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:28,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:28,886 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:29,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:29,085 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:29,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash -76241660, now seen corresponding path program 1 times [2023-12-02 18:43:29,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060117085] [2023-12-02 18:43:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:29,088 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 18:43:29,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:29,089 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:29,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:29,216 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:43:29,219 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:29,224 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 18:43:29,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:43:29,237 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:29,237 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:29,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060117085] [2023-12-02 18:43:29,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060117085] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:29,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:29,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:43:29,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307612242] [2023-12-02 18:43:29,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:29,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:29,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:29,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:29,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:29,239 INFO L87 Difference]: Start difference. First operand 2949 states and 4489 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:33,570 INFO L93 Difference]: Finished difference Result 4019 states and 5872 transitions. [2023-12-02 18:43:33,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:33,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 18:43:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:33,594 INFO L225 Difference]: With dead ends: 4019 [2023-12-02 18:43:33,594 INFO L226 Difference]: Without dead ends: 4019 [2023-12-02 18:43:33,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:33,595 INFO L413 NwaCegarLoop]: 1629 mSDtfsCounter, 1812 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1822 SdHoareTripleChecker+Valid, 2203 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:33,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1822 Valid, 2203 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 18:43:33,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4019 states. [2023-12-02 18:43:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4019 to 2858. [2023-12-02 18:43:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 1969 states have (on average 2.1462671406805485) internal successors, (4226), 2833 states have internal predecessors, (4226), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4276 transitions. [2023-12-02 18:43:33,671 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4276 transitions. Word has length 7 [2023-12-02 18:43:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:33,672 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 4276 transitions. [2023-12-02 18:43:33,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:33,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4276 transitions. [2023-12-02 18:43:33,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 18:43:33,673 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:33,673 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:33,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:33,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:33,874 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:33,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash -76241659, now seen corresponding path program 1 times [2023-12-02 18:43:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:33,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485297874] [2023-12-02 18:43:33,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:33,876 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 18:43:33,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:33,877 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:33,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:34,018 INFO L262 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:43:34,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:34,030 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 18:43:34,052 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 18:43:34,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:34,053 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:34,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485297874] [2023-12-02 18:43:34,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485297874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:34,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:34,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:43:34,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735569196] [2023-12-02 18:43:34,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:34,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:34,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:34,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:34,055 INFO L87 Difference]: Start difference. First operand 2858 states and 4276 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:40,687 INFO L93 Difference]: Finished difference Result 4373 states and 6433 transitions. [2023-12-02 18:43:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:40,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 18:43:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:40,709 INFO L225 Difference]: With dead ends: 4373 [2023-12-02 18:43:40,710 INFO L226 Difference]: Without dead ends: 4373 [2023-12-02 18:43:40,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:40,711 INFO L413 NwaCegarLoop]: 1948 mSDtfsCounter, 1251 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 2769 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:40,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 2769 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 18:43:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2023-12-02 18:43:40,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 3114. [2023-12-02 18:43:40,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 2235 states have (on average 2.135123042505593) internal successors, (4772), 3089 states have internal predecessors, (4772), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4822 transitions. [2023-12-02 18:43:40,782 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4822 transitions. Word has length 7 [2023-12-02 18:43:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:40,783 INFO L495 AbstractCegarLoop]: Abstraction has 3114 states and 4822 transitions. [2023-12-02 18:43:40,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:40,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4822 transitions. [2023-12-02 18:43:40,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 18:43:40,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:40,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:40,787 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-02 18:43:40,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:40,986 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:40,986 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:40,986 INFO L85 PathProgramCache]: Analyzing trace with hash 366061891, now seen corresponding path program 1 times [2023-12-02 18:43:40,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:40,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225751904] [2023-12-02 18:43:40,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:40,987 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 18:43:40,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:40,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:40,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:41,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:43:41,149 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:41,156 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 18:43:41,156 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:41,156 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:41,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225751904] [2023-12-02 18:43:41,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225751904] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:41,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:41,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:43:41,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336529476] [2023-12-02 18:43:41,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:41,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:41,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:41,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:41,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:41,158 INFO L87 Difference]: Start difference. First operand 3114 states and 4822 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 18:43:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:42,650 INFO L93 Difference]: Finished difference Result 3060 states and 4742 transitions. [2023-12-02 18:43:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:42,651 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 18:43:42,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:42,666 INFO L225 Difference]: With dead ends: 3060 [2023-12-02 18:43:42,666 INFO L226 Difference]: Without dead ends: 3060 [2023-12-02 18:43:42,666 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 18:43:42,667 INFO L413 NwaCegarLoop]: 1622 mSDtfsCounter, 70 mSDsluCounter, 1573 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:42,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 3195 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 18:43:42,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2023-12-02 18:43:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 3060. [2023-12-02 18:43:42,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3060 states, 2205 states have (on average 2.127891156462585) internal successors, (4692), 3035 states have internal predecessors, (4692), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:42,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4742 transitions. [2023-12-02 18:43:42,737 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4742 transitions. Word has length 10 [2023-12-02 18:43:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:42,738 INFO L495 AbstractCegarLoop]: Abstraction has 3060 states and 4742 transitions. [2023-12-02 18:43:42,738 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 18:43:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4742 transitions. [2023-12-02 18:43:42,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-02 18:43:42,739 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:42,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:42,742 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:42,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:42,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:42,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:42,940 INFO L85 PathProgramCache]: Analyzing trace with hash -401786979, now seen corresponding path program 1 times [2023-12-02 18:43:42,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:42,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961278279] [2023-12-02 18:43:42,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:42,941 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 18:43:42,941 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:42,942 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:42,944 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:43,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:43:43,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:43,175 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 18:43:43,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:43,175 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:43,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961278279] [2023-12-02 18:43:43,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961278279] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:43,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:43,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:43:43,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60106589] [2023-12-02 18:43:43,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:43:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:43:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:43,178 INFO L87 Difference]: Start difference. First operand 3060 states and 4742 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 18:43:45,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:45,017 INFO L93 Difference]: Finished difference Result 3046 states and 4700 transitions. [2023-12-02 18:43:45,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:43:45,019 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 18:43:45,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:45,035 INFO L225 Difference]: With dead ends: 3046 [2023-12-02 18:43:45,035 INFO L226 Difference]: Without dead ends: 3046 [2023-12-02 18:43:45,035 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 18:43:45,036 INFO L413 NwaCegarLoop]: 1591 mSDtfsCounter, 58 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4749 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:45,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4749 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 18:43:45,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2023-12-02 18:43:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 3044. [2023-12-02 18:43:45,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2203 states have (on average 2.109850204266909) internal successors, (4648), 3019 states have internal predecessors, (4648), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:45,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 4698 transitions. [2023-12-02 18:43:45,083 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 4698 transitions. Word has length 12 [2023-12-02 18:43:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:45,083 INFO L495 AbstractCegarLoop]: Abstraction has 3044 states and 4698 transitions. [2023-12-02 18:43:45,084 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 18:43:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 4698 transitions. [2023-12-02 18:43:45,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 18:43:45,085 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:45,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:45,091 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:45,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:45,296 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:45,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -666655844, now seen corresponding path program 1 times [2023-12-02 18:43:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:45,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013686271] [2023-12-02 18:43:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:43:45,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:45,299 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:45,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:45,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:43:45,524 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:43:45,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:45,533 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:45,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013686271] [2023-12-02 18:43:45,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013686271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:45,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:45,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:43:45,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829410304] [2023-12-02 18:43:45,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:45,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:45,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:45,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:45,535 INFO L87 Difference]: Start difference. First operand 3044 states and 4698 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:46,934 INFO L93 Difference]: Finished difference Result 2930 states and 4458 transitions. [2023-12-02 18:43:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:46,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 18:43:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:46,945 INFO L225 Difference]: With dead ends: 2930 [2023-12-02 18:43:46,945 INFO L226 Difference]: Without dead ends: 2930 [2023-12-02 18:43:46,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 18:43:46,946 INFO L413 NwaCegarLoop]: 1564 mSDtfsCounter, 70 mSDsluCounter, 1515 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 3079 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:46,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 3079 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 18:43:46,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2023-12-02 18:43:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2930. [2023-12-02 18:43:46,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 2113 states have (on average 2.0861334595362044) internal successors, (4408), 2905 states have internal predecessors, (4408), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:46,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 4458 transitions. [2023-12-02 18:43:46,995 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 4458 transitions. Word has length 17 [2023-12-02 18:43:46,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:46,995 INFO L495 AbstractCegarLoop]: Abstraction has 2930 states and 4458 transitions. [2023-12-02 18:43:46,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:46,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 4458 transitions. [2023-12-02 18:43:46,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 18:43:46,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:46,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:47,000 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:47,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:47,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:47,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:47,198 INFO L85 PathProgramCache]: Analyzing trace with hash -871126436, now seen corresponding path program 1 times [2023-12-02 18:43:47,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:47,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660834145] [2023-12-02 18:43:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:47,198 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 18:43:47,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:47,200 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:47,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:47,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-02 18:43:47,404 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:43:47,412 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:47,412 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:47,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660834145] [2023-12-02 18:43:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1660834145] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:47,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:43:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848863679] [2023-12-02 18:43:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:47,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:43:47,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:43:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:43:47,414 INFO L87 Difference]: Start difference. First operand 2930 states and 4458 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:48,930 INFO L93 Difference]: Finished difference Result 2876 states and 4378 transitions. [2023-12-02 18:43:48,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:43:48,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-12-02 18:43:48,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:48,936 INFO L225 Difference]: With dead ends: 2876 [2023-12-02 18:43:48,937 INFO L226 Difference]: Without dead ends: 2876 [2023-12-02 18:43:48,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 18:43:48,937 INFO L413 NwaCegarLoop]: 1527 mSDtfsCounter, 70 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:48,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 3005 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-02 18:43:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2876 states. [2023-12-02 18:43:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2876 to 2876. [2023-12-02 18:43:48,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2083 states have (on average 2.0777724435909746) internal successors, (4328), 2851 states have internal predecessors, (4328), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 4378 transitions. [2023-12-02 18:43:48,990 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 4378 transitions. Word has length 17 [2023-12-02 18:43:48,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:48,990 INFO L495 AbstractCegarLoop]: Abstraction has 2876 states and 4378 transitions. [2023-12-02 18:43:48,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:43:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 4378 transitions. [2023-12-02 18:43:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 18:43:48,992 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:48,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:48,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:49,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:49,192 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr358REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:49,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:49,193 INFO L85 PathProgramCache]: Analyzing trace with hash -706113418, now seen corresponding path program 1 times [2023-12-02 18:43:49,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:49,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865964586] [2023-12-02 18:43:49,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:49,194 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 18:43:49,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:49,195 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:49,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:49,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:43:49,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:49,385 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 18:43:49,385 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:49,385 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:49,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865964586] [2023-12-02 18:43:49,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865964586] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:49,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:49,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:43:49,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293146884] [2023-12-02 18:43:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:49,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:43:49,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:49,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:43:49,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:49,387 INFO L87 Difference]: Start difference. First operand 2876 states and 4378 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 18:43:51,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:51,250 INFO L93 Difference]: Finished difference Result 2862 states and 4252 transitions. [2023-12-02 18:43:51,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:43:51,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-12-02 18:43:51,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:51,256 INFO L225 Difference]: With dead ends: 2862 [2023-12-02 18:43:51,256 INFO L226 Difference]: Without dead ends: 2862 [2023-12-02 18:43:51,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 18:43:51,257 INFO L413 NwaCegarLoop]: 1496 mSDtfsCounter, 58 mSDsluCounter, 2968 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4464 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:51,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4464 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 18:43:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2023-12-02 18:43:51,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2856. [2023-12-02 18:43:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2077 states have (on average 2.0202214732787676) internal successors, (4196), 2831 states have internal predecessors, (4196), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4246 transitions. [2023-12-02 18:43:51,287 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4246 transitions. Word has length 19 [2023-12-02 18:43:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:51,288 INFO L495 AbstractCegarLoop]: Abstraction has 2856 states and 4246 transitions. [2023-12-02 18:43:51,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 18:43:51,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4246 transitions. [2023-12-02 18:43:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 18:43:51,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:51,289 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:43:51,292 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:51,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:51,489 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:51,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:51,490 INFO L85 PathProgramCache]: Analyzing trace with hash 366115190, now seen corresponding path program 1 times [2023-12-02 18:43:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:51,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461926510] [2023-12-02 18:43:51,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:51,491 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 18:43:51,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:51,492 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:51,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:51,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:43:51,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:51,684 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 18:43:51,684 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:51,684 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:51,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461926510] [2023-12-02 18:43:51,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461926510] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:51,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:51,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:43:51,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509810889] [2023-12-02 18:43:51,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:51,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:43:51,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:51,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:43:51,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:51,686 INFO L87 Difference]: Start difference. First operand 2856 states and 4246 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 18:43:53,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:53,492 INFO L93 Difference]: Finished difference Result 2842 states and 4204 transitions. [2023-12-02 18:43:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:43:53,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2023-12-02 18:43:53,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:53,498 INFO L225 Difference]: With dead ends: 2842 [2023-12-02 18:43:53,498 INFO L226 Difference]: Without dead ends: 2842 [2023-12-02 18:43:53,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 18:43:53,499 INFO L413 NwaCegarLoop]: 1475 mSDtfsCounter, 58 mSDsluCounter, 2926 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:53,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 4401 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-02 18:43:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2023-12-02 18:43:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 2840. [2023-12-02 18:43:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2840 states, 2075 states have (on average 2.000963855421687) internal successors, (4152), 2815 states have internal predecessors, (4152), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:53,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2840 states to 2840 states and 4202 transitions. [2023-12-02 18:43:53,531 INFO L78 Accepts]: Start accepts. Automaton has 2840 states and 4202 transitions. Word has length 19 [2023-12-02 18:43:53,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:53,532 INFO L495 AbstractCegarLoop]: Abstraction has 2840 states and 4202 transitions. [2023-12-02 18:43:53,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 18:43:53,532 INFO L276 IsEmpty]: Start isEmpty. Operand 2840 states and 4202 transitions. [2023-12-02 18:43:53,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:43:53,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:53,533 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 18:43:53,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:53,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:53,734 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:53,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:53,734 INFO L85 PathProgramCache]: Analyzing trace with hash 82770443, now seen corresponding path program 1 times [2023-12-02 18:43:53,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:53,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661682229] [2023-12-02 18:43:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:53,735 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 18:43:53,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:53,736 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:53,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:53,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:43:53,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:53,877 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 18:43:53,950 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 18:43:53,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:53,950 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661682229] [2023-12-02 18:43:53,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661682229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:43:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997734514] [2023-12-02 18:43:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:53,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:43:53,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:43:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:53,952 INFO L87 Difference]: Start difference. First operand 2840 states and 4202 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 18:43:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:43:58,267 INFO L93 Difference]: Finished difference Result 3098 states and 4357 transitions. [2023-12-02 18:43:58,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:43:58,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 18:43:58,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:43:58,277 INFO L225 Difference]: With dead ends: 3098 [2023-12-02 18:43:58,277 INFO L226 Difference]: Without dead ends: 3098 [2023-12-02 18:43:58,277 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 18:43:58,278 INFO L413 NwaCegarLoop]: 947 mSDtfsCounter, 1499 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 2063 SdHoareTripleChecker+Invalid, 1813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:43:58,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 2063 Invalid, 1813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-02 18:43:58,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3098 states. [2023-12-02 18:43:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2836. [2023-12-02 18:43:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2836 states, 2075 states have (on average 1.9971084337349398) internal successors, (4144), 2811 states have internal predecessors, (4144), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:43:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 4194 transitions. [2023-12-02 18:43:58,336 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 4194 transitions. Word has length 26 [2023-12-02 18:43:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:43:58,337 INFO L495 AbstractCegarLoop]: Abstraction has 2836 states and 4194 transitions. [2023-12-02 18:43:58,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 18:43:58,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 4194 transitions. [2023-12-02 18:43:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-02 18:43:58,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:43:58,338 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 18:43:58,340 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:58,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:58,538 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:43:58,539 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:43:58,539 INFO L85 PathProgramCache]: Analyzing trace with hash 82770444, now seen corresponding path program 1 times [2023-12-02 18:43:58,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:43:58,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594987975] [2023-12-02 18:43:58,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:43:58,540 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 18:43:58,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:43:58,541 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:58,542 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:43:58,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:43:58,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:43:58,685 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:43:58,692 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 18:43:58,858 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 18:43:58,859 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:43:58,859 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:43:58,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594987975] [2023-12-02 18:43:58,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594987975] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:43:58,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:43:58,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:43:58,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040106955] [2023-12-02 18:43:58,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:43:58,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:43:58,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:43:58,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:43:58,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:43:58,861 INFO L87 Difference]: Start difference. First operand 2836 states and 4194 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 18:44:05,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:05,676 INFO L93 Difference]: Finished difference Result 3478 states and 4909 transitions. [2023-12-02 18:44:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:05,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 18:44:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:05,684 INFO L225 Difference]: With dead ends: 3478 [2023-12-02 18:44:05,684 INFO L226 Difference]: Without dead ends: 3478 [2023-12-02 18:44:05,684 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 18:44:05,685 INFO L413 NwaCegarLoop]: 1271 mSDtfsCounter, 711 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 2120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 2885 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:05,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 2885 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2120 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2023-12-02 18:44:05,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2023-12-02 18:44:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 2869. [2023-12-02 18:44:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2869 states, 2108 states have (on average 1.9838709677419355) internal successors, (4182), 2844 states have internal predecessors, (4182), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:44:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2869 states to 2869 states and 4232 transitions. [2023-12-02 18:44:05,736 INFO L78 Accepts]: Start accepts. Automaton has 2869 states and 4232 transitions. Word has length 26 [2023-12-02 18:44:05,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:05,736 INFO L495 AbstractCegarLoop]: Abstraction has 2869 states and 4232 transitions. [2023-12-02 18:44:05,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 18:44:05,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2869 states and 4232 transitions. [2023-12-02 18:44:05,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:44:05,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:05,738 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] [2023-12-02 18:44:05,741 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-02 18:44:05,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:05,939 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:05,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:05,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1513515108, now seen corresponding path program 1 times [2023-12-02 18:44:05,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:05,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878683445] [2023-12-02 18:44:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:05,940 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 18:44:05,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:05,941 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:05,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:06,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:44:06,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:06,136 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 18:44:06,222 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 18:44:06,222 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:06,222 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:06,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878683445] [2023-12-02 18:44:06,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878683445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:06,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:06,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:44:06,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728039255] [2023-12-02 18:44:06,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:06,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:06,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:06,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:06,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:06,225 INFO L87 Difference]: Start difference. First operand 2869 states and 4232 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:11,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:11,197 INFO L93 Difference]: Finished difference Result 3927 states and 5690 transitions. [2023-12-02 18:44:11,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 18:44:11,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2023-12-02 18:44:11,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:11,202 INFO L225 Difference]: With dead ends: 3927 [2023-12-02 18:44:11,203 INFO L226 Difference]: Without dead ends: 3927 [2023-12-02 18:44:11,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 18:44:11,203 INFO L413 NwaCegarLoop]: 1472 mSDtfsCounter, 1621 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 3215 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:11,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 3215 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 18:44:11,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2023-12-02 18:44:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 2866. [2023-12-02 18:44:11,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2108 states have (on average 1.9734345351043643) internal successors, (4160), 2841 states have internal predecessors, (4160), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:44:11,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4210 transitions. [2023-12-02 18:44:11,237 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4210 transitions. Word has length 33 [2023-12-02 18:44:11,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:11,237 INFO L495 AbstractCegarLoop]: Abstraction has 2866 states and 4210 transitions. [2023-12-02 18:44:11,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:11,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4210 transitions. [2023-12-02 18:44:11,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:44:11,238 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:11,238 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] [2023-12-02 18:44:11,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:11,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:11,439 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:11,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1513515109, now seen corresponding path program 1 times [2023-12-02 18:44:11,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:11,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1343040991] [2023-12-02 18:44:11,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:11,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:44:11,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:11,442 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:11,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-02 18:44:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:11,674 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:44:11,676 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:11,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:44:11,867 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 18:44:11,867 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:11,868 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:11,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1343040991] [2023-12-02 18:44:11,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1343040991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:11,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:11,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:44:11,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544801109] [2023-12-02 18:44:11,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:11,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:11,870 INFO L87 Difference]: Start difference. First operand 2866 states and 4210 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:19,173 INFO L93 Difference]: Finished difference Result 4005 states and 5681 transitions. [2023-12-02 18:44:19,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2023-12-02 18:44:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:19,193 INFO L225 Difference]: With dead ends: 4005 [2023-12-02 18:44:19,194 INFO L226 Difference]: Without dead ends: 4005 [2023-12-02 18:44:19,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 18:44:19,195 INFO L413 NwaCegarLoop]: 1788 mSDtfsCounter, 1044 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 3769 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:19,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 3769 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-12-02 18:44:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4005 states. [2023-12-02 18:44:19,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4005 to 2866. [2023-12-02 18:44:19,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2866 states, 2108 states have (on average 1.9696394686907022) internal successors, (4152), 2841 states have internal predecessors, (4152), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:44:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2866 states to 2866 states and 4202 transitions. [2023-12-02 18:44:19,244 INFO L78 Accepts]: Start accepts. Automaton has 2866 states and 4202 transitions. Word has length 33 [2023-12-02 18:44:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:19,245 INFO L495 AbstractCegarLoop]: Abstraction has 2866 states and 4202 transitions. [2023-12-02 18:44:19,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2866 states and 4202 transitions. [2023-12-02 18:44:19,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:44:19,246 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:19,246 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] [2023-12-02 18:44:19,250 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Ended with exit code 0 [2023-12-02 18:44:19,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:19,447 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:19,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1988509404, now seen corresponding path program 1 times [2023-12-02 18:44:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:19,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509894667] [2023-12-02 18:44:19,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:19,449 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 18:44:19,449 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:19,450 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:19,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-02 18:44:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:19,639 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:44:19,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:19,644 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 18:44:19,720 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 18:44:19,720 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:19,720 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:19,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509894667] [2023-12-02 18:44:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509894667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:44:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428716684] [2023-12-02 18:44:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:19,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:19,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:19,723 INFO L87 Difference]: Start difference. First operand 2866 states and 4202 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:24,656 INFO L93 Difference]: Finished difference Result 3907 states and 5658 transitions. [2023-12-02 18:44:24,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:24,656 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2023-12-02 18:44:24,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:24,662 INFO L225 Difference]: With dead ends: 3907 [2023-12-02 18:44:24,662 INFO L226 Difference]: Without dead ends: 3907 [2023-12-02 18:44:24,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 18:44:24,663 INFO L413 NwaCegarLoop]: 1470 mSDtfsCounter, 1599 mSDsluCounter, 1707 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 2388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:24,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 3177 Invalid, 2388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-12-02 18:44:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2023-12-02 18:44:24,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 2862. [2023-12-02 18:44:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2108 states have (on average 1.9658444022770398) internal successors, (4144), 2837 states have internal predecessors, (4144), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:44:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 4194 transitions. [2023-12-02 18:44:24,697 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 4194 transitions. Word has length 33 [2023-12-02 18:44:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:24,698 INFO L495 AbstractCegarLoop]: Abstraction has 2862 states and 4194 transitions. [2023-12-02 18:44:24,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 4194 transitions. [2023-12-02 18:44:24,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-12-02 18:44:24,699 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:24,699 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] [2023-12-02 18:44:24,703 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-12-02 18:44:24,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:24,900 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:24,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:24,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1988509403, now seen corresponding path program 1 times [2023-12-02 18:44:24,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:24,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927093747] [2023-12-02 18:44:24,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:24,902 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 18:44:24,902 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:24,903 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:24,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:25,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:44:25,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:25,110 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 18:44:25,294 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 18:44:25,294 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:25,294 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927093747] [2023-12-02 18:44:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927093747] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:25,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:44:25,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219555634] [2023-12-02 18:44:25,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:25,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:25,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:25,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:25,296 INFO L87 Difference]: Start difference. First operand 2862 states and 4194 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:32,982 INFO L93 Difference]: Finished difference Result 3997 states and 5665 transitions. [2023-12-02 18:44:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2023-12-02 18:44:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:32,986 INFO L225 Difference]: With dead ends: 3997 [2023-12-02 18:44:32,986 INFO L226 Difference]: Without dead ends: 3997 [2023-12-02 18:44:32,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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 18:44:32,987 INFO L413 NwaCegarLoop]: 1784 mSDtfsCounter, 1036 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 3732 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:32,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 3732 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-12-02 18:44:32,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2023-12-02 18:44:33,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 2858. [2023-12-02 18:44:33,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2108 states have (on average 1.9620493358633777) internal successors, (4136), 2833 states have internal predecessors, (4136), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:44:33,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 4186 transitions. [2023-12-02 18:44:33,021 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 4186 transitions. Word has length 33 [2023-12-02 18:44:33,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:33,022 INFO L495 AbstractCegarLoop]: Abstraction has 2858 states and 4186 transitions. [2023-12-02 18:44:33,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 18:44:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 4186 transitions. [2023-12-02 18:44:33,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-02 18:44:33,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:33,023 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] [2023-12-02 18:44:33,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:33,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:33,223 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:33,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1028453637, now seen corresponding path program 1 times [2023-12-02 18:44:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:33,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708035931] [2023-12-02 18:44:33,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:33,225 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 18:44:33,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:33,226 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:33,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-02 18:44:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:33,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:44:33,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:33,491 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 18:44:33,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:33,491 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:33,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708035931] [2023-12-02 18:44:33,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708035931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:33,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:33,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:44:33,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498615047] [2023-12-02 18:44:33,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:33,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:33,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:33,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:33,493 INFO L87 Difference]: Start difference. First operand 2858 states and 4186 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 18:44:35,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:35,249 INFO L93 Difference]: Finished difference Result 2846 states and 4162 transitions. [2023-12-02 18:44:35,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:35,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2023-12-02 18:44:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:35,255 INFO L225 Difference]: With dead ends: 2846 [2023-12-02 18:44:35,255 INFO L226 Difference]: Without dead ends: 2846 [2023-12-02 18:44:35,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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 18:44:35,256 INFO L413 NwaCegarLoop]: 1462 mSDtfsCounter, 31 mSDsluCounter, 2896 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:35,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 4358 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:44:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2846 states. [2023-12-02 18:44:35,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2846 to 2846. [2023-12-02 18:44:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2846 states, 2096 states have (on average 1.9618320610687023) internal successors, (4112), 2821 states have internal predecessors, (4112), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-02 18:44:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2846 states to 2846 states and 4162 transitions. [2023-12-02 18:44:35,301 INFO L78 Accepts]: Start accepts. Automaton has 2846 states and 4162 transitions. Word has length 40 [2023-12-02 18:44:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:35,301 INFO L495 AbstractCegarLoop]: Abstraction has 2846 states and 4162 transitions. [2023-12-02 18:44:35,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 18:44:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2846 states and 4162 transitions. [2023-12-02 18:44:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-12-02 18:44:35,303 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:35,303 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] [2023-12-02 18:44:35,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-12-02 18:44:35,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:35,503 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:35,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:35,504 INFO L85 PathProgramCache]: Analyzing trace with hash 810867074, now seen corresponding path program 1 times [2023-12-02 18:44:35,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:35,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197883069] [2023-12-02 18:44:35,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:35,504 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 18:44:35,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:35,505 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:35,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-02 18:44:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:35,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:44:35,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:44:35,894 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:35,895 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:35,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197883069] [2023-12-02 18:44:35,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197883069] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:35,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:35,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:44:35,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569099097] [2023-12-02 18:44:35,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:35,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:44:35,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:35,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:44:35,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:44:35,897 INFO L87 Difference]: Start difference. First operand 2846 states and 4162 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 18:44:37,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:37,864 INFO L93 Difference]: Finished difference Result 4142 states and 5828 transitions. [2023-12-02 18:44:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:44:37,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 44 [2023-12-02 18:44:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:37,869 INFO L225 Difference]: With dead ends: 4142 [2023-12-02 18:44:37,870 INFO L226 Difference]: Without dead ends: 4142 [2023-12-02 18:44:37,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 18:44:37,870 INFO L413 NwaCegarLoop]: 1478 mSDtfsCounter, 1073 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 2842 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:37,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 2842 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-02 18:44:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4142 states. [2023-12-02 18:44:37,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4142 to 3510. [2023-12-02 18:44:37,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3510 states, 2756 states have (on average 1.9448476052249637) internal successors, (5360), 3478 states have internal predecessors, (5360), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 18:44:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3510 states to 3510 states and 5424 transitions. [2023-12-02 18:44:37,911 INFO L78 Accepts]: Start accepts. Automaton has 3510 states and 5424 transitions. Word has length 44 [2023-12-02 18:44:37,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:37,911 INFO L495 AbstractCegarLoop]: Abstraction has 3510 states and 5424 transitions. [2023-12-02 18:44:37,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 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 18:44:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 3510 states and 5424 transitions. [2023-12-02 18:44:37,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 18:44:37,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:37,912 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 18:44:37,916 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Forceful destruction successful, exit code 0 [2023-12-02 18:44:38,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:38,113 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:38,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:38,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1264994850, now seen corresponding path program 1 times [2023-12-02 18:44:38,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:38,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989241372] [2023-12-02 18:44:38,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:38,114 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 18:44:38,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:38,115 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:38,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:38,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:44:38,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:38,386 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 18:44:38,387 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:38,387 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:38,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989241372] [2023-12-02 18:44:38,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989241372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:38,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:38,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:44:38,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430862323] [2023-12-02 18:44:38,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:38,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:38,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:38,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:38,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:38,389 INFO L87 Difference]: Start difference. First operand 3510 states and 5424 transitions. Second operand has 4 states, 4 states have (on average 12.25) 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 18:44:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:40,140 INFO L93 Difference]: Finished difference Result 3468 states and 5354 transitions. [2023-12-02 18:44:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) 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 18:44:40,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:40,144 INFO L225 Difference]: With dead ends: 3468 [2023-12-02 18:44:40,144 INFO L226 Difference]: Without dead ends: 3468 [2023-12-02 18:44:40,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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 18:44:40,145 INFO L413 NwaCegarLoop]: 1458 mSDtfsCounter, 33 mSDsluCounter, 2886 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4344 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:40,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4344 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:44:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3468 states. [2023-12-02 18:44:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3468 to 3468. [2023-12-02 18:44:40,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3468 states, 2714 states have (on average 1.9491525423728813) internal successors, (5290), 3436 states have internal predecessors, (5290), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 18:44:40,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3468 states to 3468 states and 5354 transitions. [2023-12-02 18:44:40,191 INFO L78 Accepts]: Start accepts. Automaton has 3468 states and 5354 transitions. Word has length 49 [2023-12-02 18:44:40,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:40,192 INFO L495 AbstractCegarLoop]: Abstraction has 3468 states and 5354 transitions. [2023-12-02 18:44:40,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) 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 18:44:40,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3468 states and 5354 transitions. [2023-12-02 18:44:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 18:44:40,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:40,193 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] [2023-12-02 18:44:40,197 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-12-02 18:44:40,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:40,394 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:40,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1147654709, now seen corresponding path program 1 times [2023-12-02 18:44:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:40,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115880953] [2023-12-02 18:44:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:40,395 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 18:44:40,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:40,396 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:40,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-02 18:44:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:40,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:44:40,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:40,702 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 18:44:40,702 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:40,702 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:40,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115880953] [2023-12-02 18:44:40,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115880953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:44:40,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556696693] [2023-12-02 18:44:40,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:40,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:40,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:40,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:40,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:40,704 INFO L87 Difference]: Start difference. First operand 3468 states and 5354 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 18:44:42,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:42,491 INFO L93 Difference]: Finished difference Result 3450 states and 5324 transitions. [2023-12-02 18:44:42,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:42,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 52 [2023-12-02 18:44:42,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:42,496 INFO L225 Difference]: With dead ends: 3450 [2023-12-02 18:44:42,496 INFO L226 Difference]: Without dead ends: 3450 [2023-12-02 18:44:42,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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 18:44:42,497 INFO L413 NwaCegarLoop]: 1454 mSDtfsCounter, 23 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4342 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:42,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4342 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:44:42,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3450 states. [2023-12-02 18:44:42,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3450 to 3450. [2023-12-02 18:44:42,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2696 states have (on average 1.9510385756676558) internal successors, (5260), 3418 states have internal predecessors, (5260), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 18:44:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 5324 transitions. [2023-12-02 18:44:42,536 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 5324 transitions. Word has length 52 [2023-12-02 18:44:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:42,537 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 5324 transitions. [2023-12-02 18:44:42,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 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 18:44:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 5324 transitions. [2023-12-02 18:44:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-12-02 18:44:42,538 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:42,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:44:42,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-12-02 18:44:42,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:42,738 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:42,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:42,739 INFO L85 PathProgramCache]: Analyzing trace with hash -543350673, now seen corresponding path program 1 times [2023-12-02 18:44:42,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:42,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88922766] [2023-12-02 18:44:42,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:42,740 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:44:42,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:42,740 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:42,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-02 18:44:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:42,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:44:42,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:42,989 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:44:42,990 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:44:42,990 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:44:42,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-12-02 18:44:43,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:44:43,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-12-02 18:44:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 18:44:43,057 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:43,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:43,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88922766] [2023-12-02 18:44:43,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88922766] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:43,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:43,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:44:43,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237535266] [2023-12-02 18:44:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:43,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:43,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:43,059 INFO L87 Difference]: Start difference. First operand 3450 states and 5324 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:44:45,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:45,836 INFO L93 Difference]: Finished difference Result 3422 states and 5295 transitions. [2023-12-02 18:44:45,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-12-02 18:44:45,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:45,840 INFO L225 Difference]: With dead ends: 3422 [2023-12-02 18:44:45,841 INFO L226 Difference]: Without dead ends: 3422 [2023-12-02 18:44:45,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:44:45,841 INFO L413 NwaCegarLoop]: 1467 mSDtfsCounter, 4 mSDsluCounter, 2823 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:45,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4290 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-02 18:44:45,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2023-12-02 18:44:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3419. [2023-12-02 18:44:45,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 2665 states have (on average 1.9617260787992494) internal successors, (5228), 3387 states have internal predecessors, (5228), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-02 18:44:45,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5292 transitions. [2023-12-02 18:44:45,876 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5292 transitions. Word has length 55 [2023-12-02 18:44:45,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:45,876 INFO L495 AbstractCegarLoop]: Abstraction has 3419 states and 5292 transitions. [2023-12-02 18:44:45,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 18:44:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5292 transitions. [2023-12-02 18:44:45,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-02 18:44:45,877 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:45,877 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 18:44:45,882 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-02 18:44:46,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:46,078 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:46,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash 384073216, now seen corresponding path program 1 times [2023-12-02 18:44:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272112476] [2023-12-02 18:44:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:46,080 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 18:44:46,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:46,081 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:46,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:46,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:44:46,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:46,561 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 18:44:46,561 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:46,562 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:46,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272112476] [2023-12-02 18:44:46,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272112476] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:46,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 18:44:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998958540] [2023-12-02 18:44:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:46,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 18:44:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 18:44:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 18:44:46,564 INFO L87 Difference]: Start difference. First operand 3419 states and 5292 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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 18:44:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:48,327 INFO L93 Difference]: Finished difference Result 4549 states and 6755 transitions. [2023-12-02 18:44:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 18:44:48,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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 18:44:48,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:48,333 INFO L225 Difference]: With dead ends: 4549 [2023-12-02 18:44:48,333 INFO L226 Difference]: Without dead ends: 4549 [2023-12-02 18:44:48,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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 18:44:48,334 INFO L413 NwaCegarLoop]: 1688 mSDtfsCounter, 790 mSDsluCounter, 1355 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:48,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 3043 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:44:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2023-12-02 18:44:48,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 4204. [2023-12-02 18:44:48,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4204 states, 3444 states have (on average 1.9337979094076656) internal successors, (6660), 4163 states have internal predecessors, (6660), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-02 18:44:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4204 states to 4204 states and 6742 transitions. [2023-12-02 18:44:48,379 INFO L78 Accepts]: Start accepts. Automaton has 4204 states and 6742 transitions. Word has length 53 [2023-12-02 18:44:48,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:48,379 INFO L495 AbstractCegarLoop]: Abstraction has 4204 states and 6742 transitions. [2023-12-02 18:44:48,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 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 18:44:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 4204 states and 6742 transitions. [2023-12-02 18:44:48,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-02 18:44:48,380 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:48,380 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] [2023-12-02 18:44:48,385 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:48,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:48,581 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr391REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:48,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:48,581 INFO L85 PathProgramCache]: Analyzing trace with hash 25742039, now seen corresponding path program 1 times [2023-12-02 18:44:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:48,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897805465] [2023-12-02 18:44:48,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:48,582 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 18:44:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:48,583 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:48,584 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Waiting until timeout for monitored process [2023-12-02 18:44:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:48,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:44:48,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:48,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-02 18:44:48,982 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 18:44:49,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 18:44:49,441 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 18:44:49,458 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:44:49,459 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 18:44:49,474 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 18:44:49,474 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:49,474 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897805465] [2023-12-02 18:44:49,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897805465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:49,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 18:44:49,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440512799] [2023-12-02 18:44:49,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:49,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:44:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:49,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:44:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:44:49,477 INFO L87 Difference]: Start difference. First operand 4204 states and 6742 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 18:44:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:44:55,204 INFO L93 Difference]: Finished difference Result 5976 states and 9496 transitions. [2023-12-02 18:44:55,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:44:55,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 56 [2023-12-02 18:44:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:44:55,210 INFO L225 Difference]: With dead ends: 5976 [2023-12-02 18:44:55,210 INFO L226 Difference]: Without dead ends: 5976 [2023-12-02 18:44:55,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 53 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 18:44:55,210 INFO L413 NwaCegarLoop]: 479 mSDtfsCounter, 3660 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 1563 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3674 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:44:55,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3674 Valid, 823 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1563 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2023-12-02 18:44:55,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2023-12-02 18:44:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 3999. [2023-12-02 18:44:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3323 states have (on average 1.8399037014745712) internal successors, (6114), 3958 states have internal predecessors, (6114), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-02 18:44:55,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 6196 transitions. [2023-12-02 18:44:55,274 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 6196 transitions. Word has length 56 [2023-12-02 18:44:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:44:55,274 INFO L495 AbstractCegarLoop]: Abstraction has 3999 states and 6196 transitions. [2023-12-02 18:44:55,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 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 18:44:55,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 6196 transitions. [2023-12-02 18:44:55,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 18:44:55,275 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:44:55,276 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 18:44:55,281 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Ended with exit code 0 [2023-12-02 18:44:55,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:55,476 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:44:55,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:44:55,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1423239350, now seen corresponding path program 1 times [2023-12-02 18:44:55,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:44:55,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837231445] [2023-12-02 18:44:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:44:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:44:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:44:55,479 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:44:55,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (26)] Waiting until timeout for monitored process [2023-12-02 18:44:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:44:55,782 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 18:44:55,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:44:55,791 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 18:44:55,803 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 18:44:55,828 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 18:44:55,838 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 18:44:55,838 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:44:55,838 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:44:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837231445] [2023-12-02 18:44:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [837231445] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:44:55,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:44:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:44:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663838051] [2023-12-02 18:44:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:44:55,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:44:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:44:55,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:44:55,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:44:55,840 INFO L87 Difference]: Start difference. First operand 3999 states and 6196 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:00,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:00,375 INFO L93 Difference]: Finished difference Result 3998 states and 6192 transitions. [2023-12-02 18:45:00,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:45:00,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2023-12-02 18:45:00,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:00,380 INFO L225 Difference]: With dead ends: 3998 [2023-12-02 18:45:00,380 INFO L226 Difference]: Without dead ends: 3998 [2023-12-02 18:45:00,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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 18:45:00,381 INFO L413 NwaCegarLoop]: 1382 mSDtfsCounter, 3 mSDsluCounter, 2407 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3789 SdHoareTripleChecker+Invalid, 2447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:00,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3789 Invalid, 2447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-02 18:45:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3998 states. [2023-12-02 18:45:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3998 to 3998. [2023-12-02 18:45:00,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3998 states, 3323 states have (on average 1.8386999699067108) internal successors, (6110), 3957 states have internal predecessors, (6110), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-02 18:45:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3998 states to 3998 states and 6192 transitions. [2023-12-02 18:45:00,434 INFO L78 Accepts]: Start accepts. Automaton has 3998 states and 6192 transitions. Word has length 60 [2023-12-02 18:45:00,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:00,435 INFO L495 AbstractCegarLoop]: Abstraction has 3998 states and 6192 transitions. [2023-12-02 18:45:00,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:00,435 INFO L276 IsEmpty]: Start isEmpty. Operand 3998 states and 6192 transitions. [2023-12-02 18:45:00,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 18:45:00,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:00,436 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 18:45:00,442 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (26)] Ended with exit code 0 [2023-12-02 18:45:00,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:00,636 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:00,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1423239349, now seen corresponding path program 1 times [2023-12-02 18:45:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137327874] [2023-12-02 18:45:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:00,637 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 18:45:00,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:00,638 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:00,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:00,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:45:00,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:00,933 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 18:45:00,950 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 18:45:00,961 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 18:45:00,996 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 18:45:01,015 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 18:45:01,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:01,015 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:01,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137327874] [2023-12-02 18:45:01,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137327874] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:01,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:01,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:45:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709609036] [2023-12-02 18:45:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:01,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:45:01,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:01,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:45:01,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:45:01,017 INFO L87 Difference]: Start difference. First operand 3998 states and 6192 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:07,716 INFO L93 Difference]: Finished difference Result 3997 states and 6188 transitions. [2023-12-02 18:45:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:45:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2023-12-02 18:45:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:07,720 INFO L225 Difference]: With dead ends: 3997 [2023-12-02 18:45:07,721 INFO L226 Difference]: Without dead ends: 3997 [2023-12-02 18:45:07,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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 18:45:07,721 INFO L413 NwaCegarLoop]: 1382 mSDtfsCounter, 1 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3762 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:07,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3762 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2023-12-02 18:45:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2023-12-02 18:45:07,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3997. [2023-12-02 18:45:07,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3319 states have (on average 1.839710756251883) internal successors, (6106), 3956 states have internal predecessors, (6106), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-02 18:45:07,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6188 transitions. [2023-12-02 18:45:07,769 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6188 transitions. Word has length 60 [2023-12-02 18:45:07,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:07,769 INFO L495 AbstractCegarLoop]: Abstraction has 3997 states and 6188 transitions. [2023-12-02 18:45:07,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6188 transitions. [2023-12-02 18:45:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 18:45:07,770 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:07,770 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 18:45:07,775 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:07,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:07,971 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:07,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:07,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1301050154, now seen corresponding path program 1 times [2023-12-02 18:45:07,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:07,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229705860] [2023-12-02 18:45:07,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:07,972 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 18:45:07,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:07,973 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:07,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Waiting until timeout for monitored process [2023-12-02 18:45:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:08,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:45:08,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:08,258 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 18:45:08,270 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 18:45:08,294 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 18:45:08,303 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 18:45:08,304 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:08,304 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:08,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229705860] [2023-12-02 18:45:08,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229705860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:08,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:08,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:45:08,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631711390] [2023-12-02 18:45:08,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:08,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:45:08,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:08,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:45:08,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:45:08,306 INFO L87 Difference]: Start difference. First operand 3997 states and 6188 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:13,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:13,193 INFO L93 Difference]: Finished difference Result 3996 states and 6185 transitions. [2023-12-02 18:45:13,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:45:13,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2023-12-02 18:45:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:13,197 INFO L225 Difference]: With dead ends: 3996 [2023-12-02 18:45:13,198 INFO L226 Difference]: Without dead ends: 3996 [2023-12-02 18:45:13,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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 18:45:13,198 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 3 mSDsluCounter, 2404 mSDsCounter, 0 mSdLazyCounter, 2443 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3784 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:13,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3784 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2443 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-02 18:45:13,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3996 states. [2023-12-02 18:45:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3996 to 3996. [2023-12-02 18:45:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3996 states, 3319 states have (on average 1.8388068695390178) internal successors, (6103), 3955 states have internal predecessors, (6103), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-02 18:45:13,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3996 states to 3996 states and 6185 transitions. [2023-12-02 18:45:13,243 INFO L78 Accepts]: Start accepts. Automaton has 3996 states and 6185 transitions. Word has length 60 [2023-12-02 18:45:13,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:13,243 INFO L495 AbstractCegarLoop]: Abstraction has 3996 states and 6185 transitions. [2023-12-02 18:45:13,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:13,253 INFO L276 IsEmpty]: Start isEmpty. Operand 3996 states and 6185 transitions. [2023-12-02 18:45:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-02 18:45:13,254 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:13,254 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 18:45:13,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Ended with exit code 0 [2023-12-02 18:45:13,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:13,454 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:13,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1301050153, now seen corresponding path program 1 times [2023-12-02 18:45:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389287262] [2023-12-02 18:45:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:13,456 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 18:45:13,456 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:13,457 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:13,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (29)] Waiting until timeout for monitored process [2023-12-02 18:45:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:13,733 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-02 18:45:13,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:13,743 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 18:45:13,759 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 18:45:13,770 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 18:45:13,803 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 18:45:13,820 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 18:45:13,820 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:13,820 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389287262] [2023-12-02 18:45:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389287262] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:45:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951924601] [2023-12-02 18:45:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 18:45:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:13,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 18:45:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 18:45:13,822 INFO L87 Difference]: Start difference. First operand 3996 states and 6185 transitions. Second operand has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:20,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:20,376 INFO L93 Difference]: Finished difference Result 3995 states and 6182 transitions. [2023-12-02 18:45:20,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:45:20,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 60 [2023-12-02 18:45:20,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:20,381 INFO L225 Difference]: With dead ends: 3995 [2023-12-02 18:45:20,381 INFO L226 Difference]: Without dead ends: 3995 [2023-12-02 18:45:20,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 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 18:45:20,382 INFO L413 NwaCegarLoop]: 1380 mSDtfsCounter, 1 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3757 SdHoareTripleChecker+Invalid, 2469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:20,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3757 Invalid, 2469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2023-12-02 18:45:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3995 states. [2023-12-02 18:45:20,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3995 to 3995. [2023-12-02 18:45:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3316 states have (on average 1.8395657418576599) internal successors, (6100), 3954 states have internal predecessors, (6100), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-02 18:45:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 6182 transitions. [2023-12-02 18:45:20,428 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 6182 transitions. Word has length 60 [2023-12-02 18:45:20,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:20,428 INFO L495 AbstractCegarLoop]: Abstraction has 3995 states and 6182 transitions. [2023-12-02 18:45:20,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 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 18:45:20,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 6182 transitions. [2023-12-02 18:45:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-12-02 18:45:20,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:20,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:20,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (29)] Ended with exit code 0 [2023-12-02 18:45:20,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:20,631 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:20,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash -210881968, now seen corresponding path program 1 times [2023-12-02 18:45:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675269651] [2023-12-02 18:45:20,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:20,632 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 18:45:20,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:20,633 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:20,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:20,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 18:45:20,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:20,960 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 18:45:20,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:20,960 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675269651] [2023-12-02 18:45:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675269651] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:20,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:20,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 18:45:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455646846] [2023-12-02 18:45:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:20,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 18:45:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 18:45:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 18:45:20,962 INFO L87 Difference]: Start difference. First operand 3995 states and 6182 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 18:45:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:22,720 INFO L93 Difference]: Finished difference Result 3997 states and 6190 transitions. [2023-12-02 18:45:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 18:45:22,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 66 [2023-12-02 18:45:22,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:22,728 INFO L225 Difference]: With dead ends: 3997 [2023-12-02 18:45:22,728 INFO L226 Difference]: Without dead ends: 3997 [2023-12-02 18:45:22,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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 18:45:22,729 INFO L413 NwaCegarLoop]: 1379 mSDtfsCounter, 1 mSDsluCounter, 2752 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4131 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:22,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4131 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-02 18:45:22,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3997 states. [2023-12-02 18:45:22,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3997 to 3997. [2023-12-02 18:45:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3997 states, 3317 states have (on average 1.8396141091347604) internal successors, (6102), 3956 states have internal predecessors, (6102), 41 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2023-12-02 18:45:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3997 states to 3997 states and 6190 transitions. [2023-12-02 18:45:22,801 INFO L78 Accepts]: Start accepts. Automaton has 3997 states and 6190 transitions. Word has length 66 [2023-12-02 18:45:22,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:22,802 INFO L495 AbstractCegarLoop]: Abstraction has 3997 states and 6190 transitions. [2023-12-02 18:45:22,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 18:45:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3997 states and 6190 transitions. [2023-12-02 18:45:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-12-02 18:45:22,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:22,803 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:22,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:23,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:23,003 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:23,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:23,004 INFO L85 PathProgramCache]: Analyzing trace with hash 629361287, now seen corresponding path program 1 times [2023-12-02 18:45:23,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:23,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439137508] [2023-12-02 18:45:23,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:45:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:23,006 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:23,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (31)] Waiting until timeout for monitored process [2023-12-02 18:45:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:23,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:45:23,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:23,345 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 18:45:23,345 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:23,409 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 18:45:23,409 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439137508] [2023-12-02 18:45:23,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439137508] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1070458155] [2023-12-02 18:45:23,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:23,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:45:23,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:45:23,411 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:45:23,412 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-12-02 18:45:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:23,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:45:23,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:23,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 18:45:23,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:24,017 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 18:45:24,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1070458155] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:24,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351737546] [2023-12-02 18:45:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:45:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:24,019 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:45:24,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 18:45:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:24,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 18:45:24,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:24,389 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 18:45:24,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:24,415 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 18:45:24,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351737546] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:24,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:45:24,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 5, 5] total 8 [2023-12-02 18:45:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199075582] [2023-12-02 18:45:24,416 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:45:24,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 18:45:24,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 18:45:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 18:45:24,417 INFO L87 Difference]: Start difference. First operand 3997 states and 6190 transitions. Second operand has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 18:45:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:27,043 INFO L93 Difference]: Finished difference Result 4006 states and 6209 transitions. [2023-12-02 18:45:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:45:27,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2023-12-02 18:45:27,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:27,055 INFO L225 Difference]: With dead ends: 4006 [2023-12-02 18:45:27,055 INFO L226 Difference]: Without dead ends: 4006 [2023-12-02 18:45:27,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 390 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 18:45:27,056 INFO L413 NwaCegarLoop]: 1377 mSDtfsCounter, 6 mSDsluCounter, 5494 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6871 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:27,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6871 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 18:45:27,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4006 states. [2023-12-02 18:45:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4006 to 4005. [2023-12-02 18:45:27,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4005 states, 3324 states have (on average 1.8396510228640193) internal successors, (6115), 3963 states have internal predecessors, (6115), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2023-12-02 18:45:27,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 6203 transitions. [2023-12-02 18:45:27,100 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 6203 transitions. Word has length 67 [2023-12-02 18:45:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:27,100 INFO L495 AbstractCegarLoop]: Abstraction has 4005 states and 6203 transitions. [2023-12-02 18:45:27,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.333333333333334) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-02 18:45:27,100 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 6203 transitions. [2023-12-02 18:45:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 18:45:27,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:27,101 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:27,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (31)] Ended with exit code 0 [2023-12-02 18:45:27,307 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (32)] Ended with exit code 0 [2023-12-02 18:45:27,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2023-12-02 18:45:27,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:45:27,702 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr400REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:27,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1544423440, now seen corresponding path program 2 times [2023-12-02 18:45:27,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:27,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711018399] [2023-12-02 18:45:27,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:45:27,703 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 18:45:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:27,704 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:27,705 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (34)] Waiting until timeout for monitored process [2023-12-02 18:45:28,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-12-02 18:45:28,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:45:28,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-02 18:45:28,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:28,114 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 18:45:28,125 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:45:28,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:45:28,126 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 18:45:28,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2023-12-02 18:45:28,222 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:45:28,222 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 18:45:28,329 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 47 treesize of output 36 [2023-12-02 18:45:28,413 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 47 treesize of output 36 [2023-12-02 18:45:28,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 18:45:28,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-12-02 18:45:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 18:45:28,484 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 18:45:28,485 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:28,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711018399] [2023-12-02 18:45:28,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711018399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 18:45:28,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 18:45:28,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 18:45:28,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087814562] [2023-12-02 18:45:28,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 18:45:28,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 18:45:28,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:28,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 18:45:28,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-02 18:45:28,487 INFO L87 Difference]: Start difference. First operand 4005 states and 6203 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 18:45:34,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:34,540 INFO L93 Difference]: Finished difference Result 3879 states and 5810 transitions. [2023-12-02 18:45:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 18:45:34,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2023-12-02 18:45:34,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:34,549 INFO L225 Difference]: With dead ends: 3879 [2023-12-02 18:45:34,550 INFO L226 Difference]: Without dead ends: 3879 [2023-12-02 18:45:34,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-02 18:45:34,550 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 1575 mSDsluCounter, 1893 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 2472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:34,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 2740 Invalid, 2472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-12-02 18:45:34,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3879 states. [2023-12-02 18:45:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3879 to 3660. [2023-12-02 18:45:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2980 states have (on average 1.8724832214765101) internal successors, (5580), 3621 states have internal predecessors, (5580), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:45:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 5661 transitions. [2023-12-02 18:45:34,597 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 5661 transitions. Word has length 70 [2023-12-02 18:45:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:34,598 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 5661 transitions. [2023-12-02 18:45:34,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 6 states have internal predecessors, (65), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-02 18:45:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 5661 transitions. [2023-12-02 18:45:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-02 18:45:34,599 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:34,599 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:34,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (34)] Ended with exit code 0 [2023-12-02 18:45:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:34,799 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:34,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:34,800 INFO L85 PathProgramCache]: Analyzing trace with hash 118151196, now seen corresponding path program 1 times [2023-12-02 18:45:34,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:34,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1614354907] [2023-12-02 18:45:34,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:34,801 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 18:45:34,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:34,802 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:34,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-12-02 18:45:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:35,131 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:45:35,133 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:35,180 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 18:45:35,181 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:35,340 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 18:45:35,340 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:35,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1614354907] [2023-12-02 18:45:35,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1614354907] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:35,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [467574401] [2023-12-02 18:45:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:35,341 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:45:35,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:45:35,342 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:45:35,343 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2023-12-02 18:45:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:35,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-02 18:45:35,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:36,011 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 18:45:36,011 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:36,052 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 18:45:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [467574401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788483864] [2023-12-02 18:45:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:45:36,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:45:36,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:36,054 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:45:36,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-12-02 18:45:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:45:36,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 18:45:36,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:36,460 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 18:45:36,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:36,661 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 18:45:36,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788483864] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:36,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:45:36,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 20 [2023-12-02 18:45:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139612168] [2023-12-02 18:45:36,662 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:45:36,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 18:45:36,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:45:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 18:45:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2023-12-02 18:45:36,663 INFO L87 Difference]: Start difference. First operand 3660 states and 5661 transitions. Second operand has 20 states, 17 states have (on average 4.764705882352941) internal successors, (81), 20 states have internal predecessors, (81), 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 18:45:41,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:45:41,401 INFO L93 Difference]: Finished difference Result 3675 states and 5694 transitions. [2023-12-02 18:45:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 18:45:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 4.764705882352941) internal successors, (81), 20 states have internal predecessors, (81), 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 70 [2023-12-02 18:45:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:45:41,408 INFO L225 Difference]: With dead ends: 3675 [2023-12-02 18:45:41,408 INFO L226 Difference]: Without dead ends: 3672 [2023-12-02 18:45:41,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=416, Invalid=774, Unknown=0, NotChecked=0, Total=1190 [2023-12-02 18:45:41,409 INFO L413 NwaCegarLoop]: 1375 mSDtfsCounter, 13 mSDsluCounter, 10976 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12351 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:45:41,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12351 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-02 18:45:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2023-12-02 18:45:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3669. [2023-12-02 18:45:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3669 states, 2989 states have (on average 1.8705252592840416) internal successors, (5591), 3630 states have internal predecessors, (5591), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:45:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3669 states to 3669 states and 5672 transitions. [2023-12-02 18:45:41,444 INFO L78 Accepts]: Start accepts. Automaton has 3669 states and 5672 transitions. Word has length 70 [2023-12-02 18:45:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:45:41,445 INFO L495 AbstractCegarLoop]: Abstraction has 3669 states and 5672 transitions. [2023-12-02 18:45:41,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 4.764705882352941) internal successors, (81), 20 states have internal predecessors, (81), 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 18:45:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3669 states and 5672 transitions. [2023-12-02 18:45:41,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-02 18:45:41,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:45:41,445 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:45:41,455 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-12-02 18:45:41,651 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (36)] Ended with exit code 0 [2023-12-02 18:45:41,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Ended with exit code 0 [2023-12-02 18:45:42,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:42,046 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:45:42,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:45:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1620782524, now seen corresponding path program 2 times [2023-12-02 18:45:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:45:42,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265257869] [2023-12-02 18:45:42,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:45:42,048 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 18:45:42,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:45:42,048 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:45:42,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Waiting until timeout for monitored process [2023-12-02 18:45:42,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:45:42,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:45:42,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 18:45:42,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:42,788 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 18:45:42,788 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:43,415 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 18:45:43,415 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:45:43,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265257869] [2023-12-02 18:45:43,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265257869] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1860994284] [2023-12-02 18:45:43,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:45:43,416 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:45:43,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:45:43,417 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:45:43,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-12-02 18:45:45,019 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:45:45,019 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:45:45,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 18:45:45,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:45:45,108 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 18:45:45,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:45:45,295 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 18:45:45,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1860994284] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:45:45,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045995260] [2023-12-02 18:45:45,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:45:45,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:45:45,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:45:45,297 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:45:45,298 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-12-02 18:46:12,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:46:12,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:46:12,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-02 18:46:12,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:46:12,672 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 18:46:12,770 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:46:12,770 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 18:46:12,812 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 18:46:13,175 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:46:13,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:46:13,270 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 18:46:13,321 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-02 18:46:13,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:46:13,486 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:46:13,486 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 18:46:13,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045995260] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:46:13,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 5 imperfect interpolant sequences. [2023-12-02 18:46:13,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14, 14, 10] total 35 [2023-12-02 18:46:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710940135] [2023-12-02 18:46:13,627 INFO L85 oduleStraightlineAll]: Using 5 imperfect interpolants to construct interpolant automaton [2023-12-02 18:46:13,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-12-02 18:46:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:46:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-12-02 18:46:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1100, Unknown=11, NotChecked=0, Total=1332 [2023-12-02 18:46:13,628 INFO L87 Difference]: Start difference. First operand 3669 states and 5672 transitions. Second operand has 35 states, 32 states have (on average 4.65625) internal successors, (149), 34 states have internal predecessors, (149), 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 18:46:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:46:43,791 INFO L93 Difference]: Finished difference Result 5511 states and 8763 transitions. [2023-12-02 18:46:43,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 18:46:43,792 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 4.65625) internal successors, (149), 34 states have internal predecessors, (149), 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 76 [2023-12-02 18:46:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:46:43,800 INFO L225 Difference]: With dead ends: 5511 [2023-12-02 18:46:43,800 INFO L226 Difference]: Without dead ends: 5508 [2023-12-02 18:46:43,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1218 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1137, Invalid=5169, Unknown=14, NotChecked=0, Total=6320 [2023-12-02 18:46:43,802 INFO L413 NwaCegarLoop]: 780 mSDtfsCounter, 1482 mSDsluCounter, 15823 mSDsCounter, 0 mSdLazyCounter, 18104 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 16603 SdHoareTripleChecker+Invalid, 18196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 18104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.3s IncrementalHoareTripleChecker+Time [2023-12-02 18:46:43,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 16603 Invalid, 18196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 18104 Invalid, 0 Unknown, 0 Unchecked, 27.3s Time] [2023-12-02 18:46:43,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5508 states. [2023-12-02 18:46:43,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5508 to 3686. [2023-12-02 18:46:43,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3007 states have (on average 1.865979381443299) internal successors, (5611), 3647 states have internal predecessors, (5611), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:46:43,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 5692 transitions. [2023-12-02 18:46:43,849 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 5692 transitions. Word has length 76 [2023-12-02 18:46:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:46:43,849 INFO L495 AbstractCegarLoop]: Abstraction has 3686 states and 5692 transitions. [2023-12-02 18:46:43,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 4.65625) internal successors, (149), 34 states have internal predecessors, (149), 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 18:46:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 5692 transitions. [2023-12-02 18:46:43,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-12-02 18:46:43,850 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:46:43,850 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:46:43,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2023-12-02 18:46:44,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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)] Ended with exit code 0 [2023-12-02 18:46:44,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (39)] Forceful destruction successful, exit code 0 [2023-12-02 18:46:44,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 18:46:44,451 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:46:44,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:46:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -463884035, now seen corresponding path program 1 times [2023-12-02 18:46:44,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:46:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1994291510] [2023-12-02 18:46:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:46:44,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-02 18:46:44,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:46:44,453 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:46:44,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (41)] Waiting until timeout for monitored process [2023-12-02 18:46:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:46:44,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 18:46:44,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:46:45,191 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 18:46:45,192 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:46:46,695 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 18:46:46,695 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:46:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1994291510] [2023-12-02 18:46:46,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1994291510] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:46:46,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1886551027] [2023-12-02 18:46:46,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:46:46,696 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:46:46,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:46:46,696 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:46:46,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2023-12-02 18:46:47,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:46:47,521 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 18:46:47,523 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:46:47,565 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 18:46:47,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:46:47,844 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 18:46:47,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1886551027] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:46:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634595879] [2023-12-02 18:46:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:46:47,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:46:47,845 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:46:47,846 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:46:47,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2023-12-02 18:46:48,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:46:48,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-02 18:46:48,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:46:48,410 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 18:46:48,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:46:51,098 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 18:46:51,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634595879] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 18:46:51,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2023-12-02 18:46:51,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26, 26, 26, 26] total 74 [2023-12-02 18:46:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048724649] [2023-12-02 18:46:51,099 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2023-12-02 18:46:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-12-02 18:46:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:46:51,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-12-02 18:46:51,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1613, Invalid=3789, Unknown=0, NotChecked=0, Total=5402 [2023-12-02 18:46:51,104 INFO L87 Difference]: Start difference. First operand 3686 states and 5692 transitions. Second operand has 74 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 74 states have internal predecessors, (135), 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 18:47:14,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:47:14,927 INFO L93 Difference]: Finished difference Result 3744 states and 5859 transitions. [2023-12-02 18:47:14,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-02 18:47:14,928 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 74 states have internal predecessors, (135), 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 88 [2023-12-02 18:47:14,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:47:14,933 INFO L225 Difference]: With dead ends: 3744 [2023-12-02 18:47:14,933 INFO L226 Difference]: Without dead ends: 3741 [2023-12-02 18:47:14,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1989 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=6091, Invalid=13369, Unknown=0, NotChecked=0, Total=19460 [2023-12-02 18:47:14,938 INFO L413 NwaCegarLoop]: 1374 mSDtfsCounter, 50 mSDsluCounter, 39766 mSDsCounter, 0 mSdLazyCounter, 8441 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 41140 SdHoareTripleChecker+Invalid, 8606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 8441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2023-12-02 18:47:14,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 41140 Invalid, 8606 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [165 Valid, 8441 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2023-12-02 18:47:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2023-12-02 18:47:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3722. [2023-12-02 18:47:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3722 states, 3043 states have (on average 1.8596779493920472) internal successors, (5659), 3683 states have internal predecessors, (5659), 38 states have call successors, (38), 4 states have call predecessors, (38), 5 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:47:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3722 states to 3722 states and 5740 transitions. [2023-12-02 18:47:14,975 INFO L78 Accepts]: Start accepts. Automaton has 3722 states and 5740 transitions. Word has length 88 [2023-12-02 18:47:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:47:14,975 INFO L495 AbstractCegarLoop]: Abstraction has 3722 states and 5740 transitions. [2023-12-02 18:47:14,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 74 states have internal predecessors, (135), 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 18:47:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3722 states and 5740 transitions. [2023-12-02 18:47:14,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-02 18:47:14,976 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:47:14,976 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:47:14,984 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (42)] Ended with exit code 0 [2023-12-02 18:47:15,183 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (41)] Forceful destruction successful, exit code 0 [2023-12-02 18:47:15,388 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2023-12-02 18:47:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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,43 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:47:15,577 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:47:15,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:47:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1399786909, now seen corresponding path program 2 times [2023-12-02 18:47:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:47:15,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626597417] [2023-12-02 18:47:15,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:47:15,578 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 18:47:15,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:47:15,579 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:47:15,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2023-12-02 18:47:16,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:47:16,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:47:16,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 109 conjunts are in the unsatisfiable core [2023-12-02 18:47:16,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:47:16,437 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 18:47:16,661 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:47:16,662 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 18:47:16,672 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 18:47:16,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-02 18:47:16,707 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 18:47:16,799 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 18:47:16,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:47:17,452 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:47:17,452 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 18:47:17,467 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 18:47:17,500 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 18:47:17,507 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 18:47:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2023-12-02 18:47:17,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:47:18,846 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4237 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4237) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4238 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4238) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 18:47:18,852 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:47:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626597417] [2023-12-02 18:47:18,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626597417] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:47:18,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1075755350] [2023-12-02 18:47:18,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:47:18,853 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:47:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:47:18,854 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:47:18,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-12-02 18:47:21,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:47:21,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:47:21,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 110 conjunts are in the unsatisfiable core [2023-12-02 18:47:21,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:47:21,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:47:21,336 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 18:47:21,351 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:47:21,351 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 18:47:21,363 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 18:47:21,374 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 18:47:21,413 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 18:47:21,418 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 18:47:22,028 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:47:22,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:47:22,038 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 18:47:22,087 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 18:47:22,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:47:22,100 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 18:47:22,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:47:23,339 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4791 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4792) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4791) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_4792 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_4792) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv16 32) .cse1) (bvadd .cse1 (_ bv20 32))))))) is different from false [2023-12-02 18:47:23,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1075755350] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:47:23,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642310140] [2023-12-02 18:47:23,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 18:47:23,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:47:23,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:47:23,346 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:47:23,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2023-12-02 18:47:50,383 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 18:47:50,383 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 18:47:50,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 107 conjunts are in the unsatisfiable core [2023-12-02 18:47:50,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:47:50,525 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 18:47:50,535 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:47:50,536 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 18:47:50,578 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 18:47:50,584 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 18:47:50,697 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 18:47:50,702 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 18:47:51,321 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:47:51,322 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 18:47:51,330 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 18:47:51,402 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 18:47:51,409 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 18:47:51,413 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 18:47:51,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:47:52,694 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5345) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_5344 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5345 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_5345) |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~mem39#1.base| v_ArrVal_5344) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:47:52,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642310140] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:47:52,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:47:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2023-12-02 18:47:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747495778] [2023-12-02 18:47:52,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:47:52,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 18:47:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:47:52,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 18:47:52,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=173, Unknown=3, NotChecked=84, Total=306 [2023-12-02 18:47:52,702 INFO L87 Difference]: Start difference. First operand 3722 states and 5740 transitions. Second operand has 13 states, 10 states have (on average 12.4) internal successors, (124), 13 states have internal predecessors, (124), 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 18:48:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:48:10,160 INFO L93 Difference]: Finished difference Result 7593 states and 11897 transitions. [2023-12-02 18:48:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 18:48:10,160 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 12.4) internal successors, (124), 13 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2023-12-02 18:48:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:48:10,169 INFO L225 Difference]: With dead ends: 7593 [2023-12-02 18:48:10,169 INFO L226 Difference]: Without dead ends: 7591 [2023-12-02 18:48:10,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 318 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=79, Invalid=272, Unknown=3, NotChecked=108, Total=462 [2023-12-02 18:48:10,169 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 3780 mSDsluCounter, 4305 mSDsCounter, 0 mSdLazyCounter, 9324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3796 SdHoareTripleChecker+Valid, 5121 SdHoareTripleChecker+Invalid, 9361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 9324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:48:10,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3796 Valid, 5121 Invalid, 9361 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 9324 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2023-12-02 18:48:10,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2023-12-02 18:48:10,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 3770. [2023-12-02 18:48:10,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3770 states, 3091 states have (on average 1.8460045292785505) internal successors, (5706), 3730 states have internal predecessors, (5706), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:48:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 5787 transitions. [2023-12-02 18:48:10,234 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 5787 transitions. Word has length 110 [2023-12-02 18:48:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:48:10,234 INFO L495 AbstractCegarLoop]: Abstraction has 3770 states and 5787 transitions. [2023-12-02 18:48:10,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 12.4) internal successors, (124), 13 states have internal predecessors, (124), 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 18:48:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 5787 transitions. [2023-12-02 18:48:10,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 18:48:10,235 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:48:10,235 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:48:10,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (45)] Ended with exit code 0 [2023-12-02 18:48:10,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (44)] Ended with exit code 0 [2023-12-02 18:48:10,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2023-12-02 18:48:10,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,44 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,46 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:10,836 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:48:10,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:48:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 873525263, now seen corresponding path program 1 times [2023-12-02 18:48:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:48:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233388139] [2023-12-02 18:48:10,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:10,838 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 18:48:10,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:48:10,839 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:48:10,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (47)] Waiting until timeout for monitored process [2023-12-02 18:48:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:11,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 18:48:11,661 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:48:11,663 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 18:48:11,771 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:48:11,771 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 18:48:11,797 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 18:48:11,885 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 18:48:12,662 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:48:12,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-12-02 18:48:12,793 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:48:12,793 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 18:48:12,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:48:12,851 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 18:48:12,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:48:12,912 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5769 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_5769) |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 18:48:13,326 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5815 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5769 (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~mem39#1.base| v_ArrVal_5815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:48:13,328 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:48:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233388139] [2023-12-02 18:48:13,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233388139] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:13,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1923993029] [2023-12-02 18:48:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:13,328 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:48:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:48:13,329 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:48:13,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2023-12-02 18:48:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:15,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 18:48:15,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:48:15,628 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 18:48:15,888 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:48:15,888 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 18:48:15,946 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 18:48:16,072 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 18:48:16,712 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:48:16,712 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 18:48:16,831 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:48:16,831 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 18:48:16,850 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 18:48:16,859 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 18:48:16,859 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:48:21,348 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5769 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6286 (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~mem39#1.base| v_ArrVal_6286))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5769)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:48:21,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1923993029] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298157252] [2023-12-02 18:48:21,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:21,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:21,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:48:21,353 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:48:21,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-12-02 18:48:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:21,999 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 59 conjunts are in the unsatisfiable core [2023-12-02 18:48:22,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:48:22,009 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 18:48:22,107 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:48:22,107 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 18:48:22,140 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 18:48:22,517 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:48:22,517 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 18:48:22,601 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:48:22,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 18:48:24,670 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 18:48:24,673 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 18:48:24,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:48:24,693 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:48:24,693 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 18:48:24,786 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_6709) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 18:48:25,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6755 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6709 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_6755)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_6709) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1)))) is different from false [2023-12-02 18:48:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298157252] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:25,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:48:25,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 22 [2023-12-02 18:48:25,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748996889] [2023-12-02 18:48:25,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:48:25,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 18:48:25,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:48:25,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 18:48:25,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=567, Unknown=24, NotChecked=270, Total=992 [2023-12-02 18:48:25,156 INFO L87 Difference]: Start difference. First operand 3770 states and 5787 transitions. Second operand has 23 states, 19 states have (on average 7.473684210526316) internal successors, (142), 23 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 18:48:44,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:48:44,078 INFO L93 Difference]: Finished difference Result 7591 states and 11896 transitions. [2023-12-02 18:48:44,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 18:48:44,078 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.473684210526316) internal successors, (142), 23 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 112 [2023-12-02 18:48:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:48:44,086 INFO L225 Difference]: With dead ends: 7591 [2023-12-02 18:48:44,086 INFO L226 Difference]: Without dead ends: 7591 [2023-12-02 18:48:44,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 317 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=143, Invalid=609, Unknown=24, NotChecked=280, Total=1056 [2023-12-02 18:48:44,087 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 2458 mSDsluCounter, 9613 mSDsCounter, 0 mSdLazyCounter, 10387 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2481 SdHoareTripleChecker+Valid, 10402 SdHoareTripleChecker+Invalid, 10422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 10387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:48:44,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2481 Valid, 10402 Invalid, 10422 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 10387 Invalid, 0 Unknown, 0 Unchecked, 18.6s Time] [2023-12-02 18:48:44,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7591 states. [2023-12-02 18:48:44,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7591 to 3769. [2023-12-02 18:48:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3769 states, 3091 states have (on average 1.8450339695891298) internal successors, (5703), 3729 states have internal predecessors, (5703), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:48:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3769 states to 3769 states and 5784 transitions. [2023-12-02 18:48:44,148 INFO L78 Accepts]: Start accepts. Automaton has 3769 states and 5784 transitions. Word has length 112 [2023-12-02 18:48:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:48:44,149 INFO L495 AbstractCegarLoop]: Abstraction has 3769 states and 5784 transitions. [2023-12-02 18:48:44,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.473684210526316) internal successors, (142), 23 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 18:48:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3769 states and 5784 transitions. [2023-12-02 18:48:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-02 18:48:44,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:48:44,150 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:48:44,159 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (47)] Ended with exit code 0 [2023-12-02 18:48:44,366 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (48)] Ended with exit code 0 [2023-12-02 18:48:44,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2023-12-02 18:48:44,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,48 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,49 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:48:44,751 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:48:44,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:48:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash 873525264, now seen corresponding path program 1 times [2023-12-02 18:48:44,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:48:44,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105563086] [2023-12-02 18:48:44,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:44,752 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 18:48:44,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:48:44,753 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:48:44,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (50)] Waiting until timeout for monitored process [2023-12-02 18:48:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:48:45,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 112 conjunts are in the unsatisfiable core [2023-12-02 18:48:45,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:48:45,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:48:45,798 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:48:45,798 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 18:48:45,804 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 18:48:45,822 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 18:48:45,829 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 18:48:45,918 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 18:48:45,923 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 18:48:46,578 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:48:46,578 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 18:48:46,585 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 18:48:46,697 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:48:46,697 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 18:48:46,708 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 18:48:46,720 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 18:48:46,726 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 18:48:46,749 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 18:48:46,749 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:48:46,892 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7224) |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 18:48:46,932 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_7225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv4 32)) (bvadd .cse2 (_ bv8 32)))))))) is different from false [2023-12-02 18:48:48,149 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7225 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7317))) (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~mem39#1.base| v_ArrVal_7316) .cse0 v_ArrVal_7224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7225) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7317 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7316 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7224 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7316) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7317) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7224) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32))))))) is different from false [2023-12-02 18:48:48,159 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:48:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105563086] [2023-12-02 18:48:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105563086] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:48:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121004757] [2023-12-02 18:48:48,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:48:48,160 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:48:48,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:48:48,161 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:48:48,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2023-12-02 18:50:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:40,856 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 113 conjunts are in the unsatisfiable core [2023-12-02 18:50:40,868 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:40,872 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 18:50:41,119 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 18:50:41,134 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:50:41,135 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 18:50:41,181 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 18:50:41,195 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 18:50:41,333 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 18:50:41,337 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 18:50:41,952 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:50:41,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:50:41,958 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 18:50:42,136 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:50:42,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-12-02 18:50:42,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:50:42,161 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 18:50:42,166 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 18:50:42,172 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 18:50:42,172 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:42,238 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7787) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_7786) |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 18:50:42,279 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_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_7787) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_7786) |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 18:50:43,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7879) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7878) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_7879 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7878 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7787 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7786 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_7878))) (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~mem39#1.base| v_ArrVal_7879) .cse2 v_ArrVal_7786) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_7787) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:50:43,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [121004757] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:43,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815260800] [2023-12-02 18:50:43,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:50:43,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:50:43,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:50:43,588 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:50:43,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2023-12-02 18:50:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:50:44,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 111 conjunts are in the unsatisfiable core [2023-12-02 18:50:44,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:50:44,273 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 18:50:44,394 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:50:44,394 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 18:50:44,400 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 18:50:44,415 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 18:50:44,423 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 18:50:44,481 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 18:50:44,484 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 18:50:45,096 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:50:45,096 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 18:50:45,109 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 18:50:45,181 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:50:45,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 62 treesize of output 57 [2023-12-02 18:50:45,187 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 18:50:45,211 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 18:50:45,218 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 18:50:45,221 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 18:50:45,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:50:45,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_8349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:50:45,318 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_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_8349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_8348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_8349) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:50:46,549 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_8349 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8441))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8440) .cse0 v_ArrVal_8348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8349) |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_8348 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8440) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8348) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse3) (bvadd (_ bv8 32) .cse3)))))) is different from false [2023-12-02 18:50:46,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815260800] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:50:46,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:50:46,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 18:50:46,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112961914] [2023-12-02 18:50:46,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:50:46,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 18:50:46,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:50:46,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 18:50:46,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=231, Unknown=9, NotChecked=342, Total=650 [2023-12-02 18:50:46,560 INFO L87 Difference]: Start difference. First operand 3769 states and 5784 transitions. Second operand has 15 states, 12 states have (on average 10.666666666666666) internal successors, (128), 15 states have internal predecessors, (128), 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 18:51:11,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:51:11,677 INFO L93 Difference]: Finished difference Result 7589 states and 11887 transitions. [2023-12-02 18:51:11,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 18:51:11,678 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 10.666666666666666) internal successors, (128), 15 states have internal predecessors, (128), 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 112 [2023-12-02 18:51:11,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:51:11,692 INFO L225 Difference]: With dead ends: 7589 [2023-12-02 18:51:11,692 INFO L226 Difference]: Without dead ends: 7589 [2023-12-02 18:51:11,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 322 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=378, Unknown=9, NotChecked=432, Total=930 [2023-12-02 18:51:11,693 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 3775 mSDsluCounter, 5677 mSDsCounter, 0 mSdLazyCounter, 12633 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3791 SdHoareTripleChecker+Valid, 6493 SdHoareTripleChecker+Invalid, 12670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 12633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2023-12-02 18:51:11,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3791 Valid, 6493 Invalid, 12670 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [37 Valid, 12633 Invalid, 0 Unknown, 0 Unchecked, 24.7s Time] [2023-12-02 18:51:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7589 states. [2023-12-02 18:51:11,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7589 to 3768. [2023-12-02 18:51:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3091 states have (on average 1.8440634098997088) internal successors, (5700), 3728 states have internal predecessors, (5700), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:51:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 5781 transitions. [2023-12-02 18:51:11,732 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 5781 transitions. Word has length 112 [2023-12-02 18:51:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:51:11,733 INFO L495 AbstractCegarLoop]: Abstraction has 3768 states and 5781 transitions. [2023-12-02 18:51:11,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 10.666666666666666) internal successors, (128), 15 states have internal predecessors, (128), 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 18:51:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 5781 transitions. [2023-12-02 18:51:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 18:51:11,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:51:11,733 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:51:11,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (51)] Ended with exit code 0 [2023-12-02 18:51:11,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2023-12-02 18:51:12,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (50)] Forceful destruction successful, exit code 0 [2023-12-02 18:51:12,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,52 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,50 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:51:12,334 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:51:12,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:51:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1942219804, now seen corresponding path program 1 times [2023-12-02 18:51:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:51:12,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1952096583] [2023-12-02 18:51:12,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:12,336 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 18:51:12,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:51:12,337 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:51:12,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (53)] Waiting until timeout for monitored process [2023-12-02 18:51:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:51:13,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 18:51:13,361 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:51:13,364 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 18:51:13,500 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:51:13,500 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 18:51:13,536 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 18:51:13,627 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 18:51:14,453 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:51:14,453 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 18:51:14,573 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:51:14,574 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 18:51:14,650 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:51:14,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 44 treesize of output 43 [2023-12-02 18:51:14,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:51:14,706 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 18:51:14,706 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:51:16,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8881 (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_8881) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2023-12-02 18:51:16,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8880 (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~mem41#1.base| v_ArrVal_8880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8881)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:51:16,847 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8880 (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_8880))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8881)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:51:17,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_8881 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8880 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8927 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_8927))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8880)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8881)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 18:51:17,265 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:51:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1952096583] [2023-12-02 18:51:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1952096583] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:51:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1384129874] [2023-12-02 18:51:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:51:17,266 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:51:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:51:17,267 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:51:17,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2023-12-02 18:52:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:02,358 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 119 conjunts are in the unsatisfiable core [2023-12-02 18:52:02,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:02,372 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 18:52:02,640 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:52:02,640 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 18:52:02,709 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 18:52:02,719 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 18:52:02,892 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 18:52:02,896 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 18:52:04,027 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:52:04,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-02 18:52:04,033 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 18:52:04,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:52:04,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-12-02 18:52:04,251 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 18:52:04,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-12-02 18:52:04,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 66 [2023-12-02 18:52:04,415 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 18:52:04,424 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 18:52:04,424 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:52:04,490 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9415) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (let ((.cse3 (bvadd |c_ULTIMATE.start_main_#t~mem42#1.offset| (_ bv7 32)))) (store (let ((.cse2 (bvadd (_ bv6 32) |c_ULTIMATE.start_main_#t~mem42#1.offset|))) (store (let ((.cse1 (bvadd |c_ULTIMATE.start_main_#t~mem42#1.offset| (_ bv5 32)))) (store (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_#t~mem42#1.offset|))) (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base|) .cse0 (select v_ArrVal_9415 .cse0))) .cse1 (select v_ArrVal_9415 .cse1))) .cse2 (select v_ArrVal_9415 .cse2))) .cse3 (select v_ArrVal_9415 .cse3))) v_ArrVal_9415)))) is different from false [2023-12-02 18:52:04,550 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (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|) .cse6))) (or (not (= (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse5 (bvadd .cse2 (_ bv7 32)))) (store (let ((.cse4 (bvadd .cse2 (_ bv6 32)))) (store (let ((.cse3 (bvadd .cse2 (_ bv5 32)))) (store (let ((.cse1 (bvadd (_ bv4 32) .cse2))) (store (select |c_#memory_$Pointer$.base| .cse0) .cse1 (select v_ArrVal_9415 .cse1))) .cse3 (select v_ArrVal_9415 .cse3))) .cse4 (select v_ArrVal_9415 .cse4))) .cse5 (select v_ArrVal_9415 .cse5)))) v_ArrVal_9415)) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_9415) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)) (_ bv1 1))))))) is different from false [2023-12-02 18:52:05,018 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9412)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_9415) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (_ bv1 1))) (not (= (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (bvadd .cse4 (_ bv7 32)))) (store (let ((.cse6 (bvadd (_ bv6 32) .cse4))) (store (let ((.cse5 (bvadd .cse4 (_ bv5 32)))) (store (let ((.cse3 (bvadd (_ bv4 32) .cse4))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_9415 .cse3))) .cse5 (select v_ArrVal_9415 .cse5))) .cse6 (select v_ArrVal_9415 .cse6))) .cse7 (select v_ArrVal_9415 .cse7)))) v_ArrVal_9415)))))) is different from false [2023-12-02 18:52:05,097 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_9412))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (or (not (= (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse6 (bvadd .cse3 (_ bv7 32)))) (store (let ((.cse5 (bvadd (_ bv6 32) .cse3))) (store (let ((.cse4 (bvadd .cse3 (_ bv5 32)))) (store (let ((.cse2 (bvadd (_ bv4 32) .cse3))) (store (select .cse0 .cse1) .cse2 (select v_ArrVal_9415 .cse2))) .cse4 (select v_ArrVal_9415 .cse4))) .cse5 (select v_ArrVal_9415 .cse5))) .cse6 (select v_ArrVal_9415 .cse6)))) v_ArrVal_9415)) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_9415) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)) (_ bv1 1))))))))) is different from false [2023-12-02 18:52:06,511 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9507 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9506 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9415 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9412 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9507)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse0 (store .cse9 .cse8 v_ArrVal_9412))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (or (= (bvadd (select |c_#valid| (select (select (store .cse0 .cse1 v_ArrVal_9415) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (_ bv1 1)) (_ bv0 1)) (not (= (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9506) .cse8 v_ArrVal_9413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse7 (bvadd .cse4 (_ bv7 32)))) (store (let ((.cse6 (bvadd (_ bv6 32) .cse4))) (store (let ((.cse5 (bvadd .cse4 (_ bv5 32)))) (store (let ((.cse3 (bvadd (_ bv4 32) .cse4))) (store (select .cse0 .cse1) .cse3 (select v_ArrVal_9415 .cse3))) .cse5 (select v_ArrVal_9415 .cse5))) .cse6 (select v_ArrVal_9415 .cse6))) .cse7 (select v_ArrVal_9415 .cse7)))) v_ArrVal_9415)))))))) is different from false [2023-12-02 18:52:06,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1384129874] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:52:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744990009] [2023-12-02 18:52:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:06,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:52:06,527 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:52:06,527 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:52:06,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2023-12-02 18:52:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:07,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 61 conjunts are in the unsatisfiable core [2023-12-02 18:52:07,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:07,286 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 18:52:07,385 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:52:07,385 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 18:52:07,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-12-02 18:52:08,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:52:08,079 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 18:52:08,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:52:08,237 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 18:52:08,333 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:52:08,334 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 18:52:08,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 33 treesize of output 15 [2023-12-02 18:52:08,349 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 18:52:08,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:52:08,363 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_9946) |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 18:52:08,374 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9946 (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_9946) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (_ bv0 1))) is different from false [2023-12-02 18:52:08,393 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9945 (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~mem41#1.base| v_ArrVal_9945))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9946)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:52:08,406 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9945))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9946)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-12-02 18:52:08,806 INFO L349 Elim1Store]: treesize reduction 7, result has 87.3 percent of original size [2023-12-02 18:52:08,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2023-12-02 18:52:08,819 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9992 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9946 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9945 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_9992))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9945)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9946)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem39#1.base|)) is different from false [2023-12-02 18:52:08,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744990009] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:52:08,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:52:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 12] total 29 [2023-12-02 18:52:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487253062] [2023-12-02 18:52:08,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:52:08,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-02 18:52:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:52:08,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-02 18:52:08,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=849, Unknown=17, NotChecked=1022, Total=2070 [2023-12-02 18:52:08,825 INFO L87 Difference]: Start difference. First operand 3768 states and 5781 transitions. Second operand has 30 states, 26 states have (on average 5.846153846153846) internal successors, (152), 29 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:52:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:52:31,497 INFO L93 Difference]: Finished difference Result 7589 states and 11890 transitions. [2023-12-02 18:52:31,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 18:52:31,497 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 5.846153846153846) internal successors, (152), 29 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 114 [2023-12-02 18:52:31,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:52:31,503 INFO L225 Difference]: With dead ends: 7589 [2023-12-02 18:52:31,504 INFO L226 Difference]: Without dead ends: 7589 [2023-12-02 18:52:31,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 317 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=223, Invalid=1076, Unknown=17, NotChecked=1134, Total=2450 [2023-12-02 18:52:31,505 INFO L413 NwaCegarLoop]: 786 mSDtfsCounter, 2449 mSDsluCounter, 11342 mSDsCounter, 0 mSdLazyCounter, 12252 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2472 SdHoareTripleChecker+Valid, 12128 SdHoareTripleChecker+Invalid, 12288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 12252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.1s IncrementalHoareTripleChecker+Time [2023-12-02 18:52:31,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2472 Valid, 12128 Invalid, 12288 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [36 Valid, 12252 Invalid, 0 Unknown, 0 Unchecked, 22.1s Time] [2023-12-02 18:52:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7589 states. [2023-12-02 18:52:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7589 to 3767. [2023-12-02 18:52:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3091 states have (on average 1.843092850210288) internal successors, (5697), 3727 states have internal predecessors, (5697), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:52:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 5778 transitions. [2023-12-02 18:52:31,546 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 5778 transitions. Word has length 114 [2023-12-02 18:52:31,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:52:31,546 INFO L495 AbstractCegarLoop]: Abstraction has 3767 states and 5778 transitions. [2023-12-02 18:52:31,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 5.846153846153846) internal successors, (152), 29 states have internal predecessors, (152), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-02 18:52:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 5778 transitions. [2023-12-02 18:52:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-02 18:52:31,547 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:52:31,547 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:52:31,565 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2023-12-02 18:52:31,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (54)] Ended with exit code 0 [2023-12-02 18:52:31,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (53)] Forceful destruction successful, exit code 0 [2023-12-02 18:52:32,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,54 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,53 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:52:32,148 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:52:32,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:52:32,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1942219805, now seen corresponding path program 1 times [2023-12-02 18:52:32,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:52:32,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611394142] [2023-12-02 18:52:32,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:32,150 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 18:52:32,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:52:32,151 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:52:32,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (56)] Waiting until timeout for monitored process [2023-12-02 18:52:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:52:33,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 18:52:33,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:52:33,249 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 18:52:33,355 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 18:52:33,369 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:52:33,369 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 18:52:33,400 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 18:52:33,405 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 18:52:33,509 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 18:52:33,514 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 18:52:34,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:52:34,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:52:34,145 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 18:52:34,239 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:52:34,239 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 18:52:34,244 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 18:52:34,327 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:52:34,328 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 18:52:34,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:52:34,353 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 18:52:34,360 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 18:52:34,389 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 18:52:34,389 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:52:34,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_10478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:52:34,566 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_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10479) |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 18:52:34,674 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10476))) (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~mem41#1.base| v_ArrVal_10477) .cse0 v_ArrVal_10479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10477) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_10476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10479) |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 18:52:34,746 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_10476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10476))) (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_10477) .cse1 v_ArrVal_10479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10477) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10479) |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 18:52:37,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10571))) (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~mem39#1.base| v_ArrVal_10570) .cse1 v_ArrVal_10477) (select (select (store .cse2 .cse1 v_ArrVal_10476) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10479))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_10571 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10476 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10477 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10478 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10479 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_10571))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_10476))) (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~mem39#1.base| v_ArrVal_10570) .cse4 v_ArrVal_10477) .cse5 v_ArrVal_10479) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_10478) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 18:52:37,403 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:52:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611394142] [2023-12-02 18:52:37,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611394142] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:52:37,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1899300368] [2023-12-02 18:52:37,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:52:37,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:52:37,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:52:37,405 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:52:37,406 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (57)] Waiting until timeout for monitored process [2023-12-02 18:53:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:37,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 18:53:37,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:37,818 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 18:53:38,310 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 18:53:38,332 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:53:38,332 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 18:53:38,419 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 18:53:38,424 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 18:53:38,658 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 18:53:38,664 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 18:53:39,536 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:53:39,536 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 18:53:39,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:53:39,801 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:53:39,801 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 18:53:39,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-12-02 18:53:39,974 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:53:39,975 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 18:53:39,984 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 18:53:40,010 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 18:53:40,020 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 18:53:40,022 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 18:53:40,022 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:40,082 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11058) |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~mem42#1.base| v_ArrVal_11057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11058) |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 18:53:40,125 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_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:53:40,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11056) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_11055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11055))) (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~mem41#1.base| v_ArrVal_11056) .cse2 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:53:40,384 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_11055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11055))) (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_11056) .cse1 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11056) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11058) |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 18:53:41,881 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11149))) (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~mem39#1.base| v_ArrVal_11150) .cse1 v_ArrVal_11056) (select (select (store .cse2 .cse1 v_ArrVal_11055) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_11058))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_11055 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11056 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11057 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11058 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11149 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11150 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11149))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_11055))) (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~mem39#1.base| v_ArrVal_11150) .cse4 v_ArrVal_11056) .cse5 v_ArrVal_11058) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_11057) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 18:53:41,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1899300368] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:53:41,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297343161] [2023-12-02 18:53:41,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:53:41,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:53:41,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:53:41,895 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:53:41,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2023-12-02 18:53:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:53:42,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 114 conjunts are in the unsatisfiable core [2023-12-02 18:53:42,786 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:53:42,791 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 18:53:42,985 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 18:53:43,008 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:53:43,008 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 18:53:43,026 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 18:53:43,048 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 18:53:43,112 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 18:53:43,118 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 18:53:44,016 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:53:44,017 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 18:53:44,025 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 18:53:44,144 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:53:44,144 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 18:53:44,152 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 18:53:44,229 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:53:44,229 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 18:53:44,248 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 18:53:44,267 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 18:53:44,278 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 18:53:44,285 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 18:53:44,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:53:44,353 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_11637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:53:44,408 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_11636 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_11637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:53:44,528 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11635) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_11634))) (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~mem41#1.base| v_ArrVal_11635) .cse2 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_11637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:53:44,704 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_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11634))) (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_11635) .cse1 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_11635) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_11634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11636) |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 18:53:46,666 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_11729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11728 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11637 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11729))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_11634))) (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~mem39#1.base| v_ArrVal_11728) .cse0 v_ArrVal_11635) .cse1 v_ArrVal_11636) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_11637) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_11729 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11635 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11636 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_11728 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_11729))) (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~mem39#1.base| v_ArrVal_11728) .cse6 v_ArrVal_11635) (select (select (store .cse7 .cse6 v_ArrVal_11634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_11636))) |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 18:53:46,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297343161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:53:46,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:53:46,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2023-12-02 18:53:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230915019] [2023-12-02 18:53:46,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:53:46,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 18:53:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:53:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 18:53:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=297, Unknown=15, NotChecked=720, Total=1122 [2023-12-02 18:53:46,685 INFO L87 Difference]: Start difference. First operand 3767 states and 5778 transitions. Second operand has 17 states, 14 states have (on average 9.428571428571429) internal successors, (132), 17 states have internal predecessors, (132), 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 18:54:29,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:54:29,274 INFO L93 Difference]: Finished difference Result 7587 states and 11881 transitions. [2023-12-02 18:54:29,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 18:54:29,274 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 9.428571428571429) internal successors, (132), 17 states have internal predecessors, (132), 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 114 [2023-12-02 18:54:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:54:29,280 INFO L225 Difference]: With dead ends: 7587 [2023-12-02 18:54:29,280 INFO L226 Difference]: Without dead ends: 7587 [2023-12-02 18:54:29,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 326 SyntacticMatches, 5 SemanticMatches, 38 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=143, Invalid=502, Unknown=15, NotChecked=900, Total=1560 [2023-12-02 18:54:29,281 INFO L413 NwaCegarLoop]: 816 mSDtfsCounter, 2435 mSDsluCounter, 6662 mSDsCounter, 0 mSdLazyCounter, 14015 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 7478 SdHoareTripleChecker+Invalid, 14033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 14015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.9s IncrementalHoareTripleChecker+Time [2023-12-02 18:54:29,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2451 Valid, 7478 Invalid, 14033 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [18 Valid, 14015 Invalid, 0 Unknown, 0 Unchecked, 41.9s Time] [2023-12-02 18:54:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7587 states. [2023-12-02 18:54:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7587 to 3766. [2023-12-02 18:54:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3766 states, 3091 states have (on average 1.842122290520867) internal successors, (5694), 3726 states have internal predecessors, (5694), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:54:29,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 5775 transitions. [2023-12-02 18:54:29,329 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 5775 transitions. Word has length 114 [2023-12-02 18:54:29,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:54:29,330 INFO L495 AbstractCegarLoop]: Abstraction has 3766 states and 5775 transitions. [2023-12-02 18:54:29,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 9.428571428571429) internal successors, (132), 17 states have internal predecessors, (132), 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 18:54:29,330 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 5775 transitions. [2023-12-02 18:54:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 18:54:29,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:54:29,331 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:54:29,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2023-12-02 18:54:29,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (56)] Forceful destruction successful, exit code 0 [2023-12-02 18:54:29,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (57)] Ended with exit code 0 [2023-12-02 18:54:29,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,56 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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,57 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt [2023-12-02 18:54:29,931 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:54:29,932 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:54:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1834481916, now seen corresponding path program 1 times [2023-12-02 18:54:29,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:54:29,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536810698] [2023-12-02 18:54:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:29,933 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 18:54:29,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:54:29,934 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:54:29,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (59)] Waiting until timeout for monitored process [2023-12-02 18:54:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:54:31,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 18:54:31,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:54:31,098 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 18:54:31,360 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:54:31,360 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 18:54:31,399 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 18:54:31,539 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 18:54:32,845 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:54:32,845 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 18:54:33,018 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:54:33,018 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 18:54:33,150 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:54:33,150 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 18:54:33,296 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:54:33,296 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 18:54:33,323 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 18:54:33,393 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 18:54:33,393 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:54:33,497 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_12185) |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 18:54:33,514 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12185 (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_12185) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:54:33,534 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (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~mem42#1.base| v_ArrVal_12184))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:54:33,555 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (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_12184))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:54:33,577 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (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~mem41#1.base| v_ArrVal_12183))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12184)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:54:33,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12184 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12185 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12183 (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_12183))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12184)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12185)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:54:34,210 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:54:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536810698] [2023-12-02 18:54:34,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536810698] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:54:34,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1153610831] [2023-12-02 18:54:34,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:54:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:54:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:54:34,211 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:54:34,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (60)] Waiting until timeout for monitored process [2023-12-02 18:55:48,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:55:48,476 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 18:55:48,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:55:48,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-02 18:55:49,036 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-12-02 18:55:49,036 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 18:55:49,157 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 18:55:49,403 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 18:55:50,612 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:55:50,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 36 treesize of output 35 [2023-12-02 18:55:50,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:55:50,870 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 18:55:51,058 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:55:51,058 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 18:55:51,240 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-12-02 18:55:51,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-12-02 18:55:51,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-12-02 18:55:51,283 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 18:55:51,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:55:53,431 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12688 (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_12688) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:55:53,451 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12687 (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~mem42#1.base| v_ArrVal_12687))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12688)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:55:53,472 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12687 (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_12687))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12688)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:55:53,495 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12687 (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~mem41#1.base| v_ArrVal_12686))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12687)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12688)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-12-02 18:55:53,519 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12687 (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_12686))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12687)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12688)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:55:53,979 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_12734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12686 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12688 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_12687 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_12734))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12686)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12687)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_12688)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-12-02 18:55:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1153610831] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:55:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418396661] [2023-12-02 18:55:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:55:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 18:55:53,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 18:55:53,986 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 18:55:53,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2023-12-02 18:55:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:55:54,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 63 conjunts are in the unsatisfiable core [2023-12-02 18:55:54,879 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:55:54,883 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 18:55:55,130 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:55:55,130 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 18:55:55,210 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 18:55:55,943 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:55,943 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 18:55:56,088 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:56,088 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 18:55:56,233 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:56,233 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 18:55:56,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:55:56,386 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 18:55:56,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-12-02 18:55:56,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 18:55:56,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:55:56,555 INFO L349 Elim1Store]: treesize reduction 7, result has 63.2 percent of original size [2023-12-02 18:55:56,555 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 18:55:56,750 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2023-12-02 18:55:56,767 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_13188)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_13189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2023-12-02 18:55:56,784 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13188))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_13189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2023-12-02 18:55:56,805 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_13187))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13188)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_13189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 18:55:56,825 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13187))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13188)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_13189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 18:55:57,290 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13235 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13188 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13187 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13189 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (let ((.cse0 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_13235))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13187)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13188)))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_13189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2023-12-02 18:55:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418396661] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:55:57,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 18:55:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 28 [2023-12-02 18:55:57,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714838133] [2023-12-02 18:55:57,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 18:55:57,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 18:55:57,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-12-02 18:55:57,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 18:55:57,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=888, Unknown=45, NotChecked=1422, Total=2550 [2023-12-02 18:55:57,297 INFO L87 Difference]: Start difference. First operand 3766 states and 5775 transitions. Second operand has 29 states, 25 states have (on average 6.16) internal successors, (154), 29 states have internal predecessors, (154), 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 18:56:22,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 18:56:22,286 INFO L93 Difference]: Finished difference Result 7587 states and 11884 transitions. [2023-12-02 18:56:22,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 18:56:22,287 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 6.16) internal successors, (154), 29 states have internal predecessors, (154), 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 116 [2023-12-02 18:56:22,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 18:56:22,293 INFO L225 Difference]: With dead ends: 7587 [2023-12-02 18:56:22,293 INFO L226 Difference]: Without dead ends: 7587 [2023-12-02 18:56:22,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 323 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=206, Invalid=943, Unknown=45, NotChecked=1458, Total=2652 [2023-12-02 18:56:22,294 INFO L413 NwaCegarLoop]: 789 mSDtfsCounter, 2467 mSDsluCounter, 7655 mSDsCounter, 0 mSdLazyCounter, 8391 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2490 SdHoareTripleChecker+Valid, 8444 SdHoareTripleChecker+Invalid, 8447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 8391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2023-12-02 18:56:22,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2490 Valid, 8444 Invalid, 8447 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [56 Valid, 8391 Invalid, 0 Unknown, 0 Unchecked, 24.6s Time] [2023-12-02 18:56:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7587 states. [2023-12-02 18:56:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7587 to 3765. [2023-12-02 18:56:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3765 states, 3091 states have (on average 1.8411517308314462) internal successors, (5691), 3725 states have internal predecessors, (5691), 38 states have call successors, (38), 5 states have call predecessors, (38), 6 states have return successors, (43), 35 states have call predecessors, (43), 38 states have call successors, (43) [2023-12-02 18:56:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3765 states to 3765 states and 5772 transitions. [2023-12-02 18:56:22,336 INFO L78 Accepts]: Start accepts. Automaton has 3765 states and 5772 transitions. Word has length 116 [2023-12-02 18:56:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 18:56:22,336 INFO L495 AbstractCegarLoop]: Abstraction has 3765 states and 5772 transitions. [2023-12-02 18:56:22,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 6.16) internal successors, (154), 29 states have internal predecessors, (154), 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 18:56:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 3765 states and 5772 transitions. [2023-12-02 18:56:22,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-02 18:56:22,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 18:56:22,337 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 18:56:22,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (60)] Ended with exit code 0 [2023-12-02 18:56:22,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2023-12-02 18:56:22,747 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (59)] Ended with exit code 0 [2023-12-02 18:56:22,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt,61 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,59 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:56:22,938 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2023-12-02 18:56:22,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 18:56:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1834481915, now seen corresponding path program 1 times [2023-12-02 18:56:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-12-02 18:56:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436204262] [2023-12-02 18:56:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:56:22,939 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 18:56:22,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/mathsat [2023-12-02 18:56:22,940 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 18:56:22,940 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/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 (62)] Waiting until timeout for monitored process [2023-12-02 18:56:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 18:56:24,269 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 117 conjunts are in the unsatisfiable core [2023-12-02 18:56:24,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 18:56:24,283 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 18:56:24,535 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-02 18:56:24,535 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 18:56:24,549 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 18:56:24,584 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 18:56:24,607 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 18:56:24,742 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 18:56:24,748 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 18:56:25,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:56:25,775 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 18:56:25,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-12-02 18:56:25,960 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:56:25,961 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 18:56:25,969 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 18:56:26,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:56:26,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-12-02 18:56:26,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 18:56:26,262 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-12-02 18:56:26,263 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 18:56:26,270 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 18:56:26,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-12-02 18:56:26,316 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 18:56:26,370 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 18:56:26,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 18:56:26,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem43#1.base| v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-12-02 18:56:26,632 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_13739 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-12-02 18:56:26,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_13737) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem42#1.base| v_ArrVal_13736))) (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~mem42#1.base| v_ArrVal_13737) .cse2 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-12-02 18:56:26,740 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_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13736))) (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_13737) .cse1 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13737) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_13739) |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 18:56:26,818 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_13735))) (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~mem41#1.base| v_ArrVal_13734) .cse1 v_ArrVal_13737) (select (select (store .cse2 .cse1 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_13739))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem41#1.base| v_ArrVal_13735))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_13736))) (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~mem41#1.base| v_ArrVal_13734) .cse4 v_ArrVal_13737) .cse5 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) is different from false [2023-12-02 18:56:26,892 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_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_13735))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_13734) .cse2 v_ArrVal_13737) (select (select (store .cse3 .cse2 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_13739))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_13735))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_13736))) (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_13734) .cse5 v_ArrVal_13737) .cse6 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-12-02 18:56:28,531 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_13831))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_13735))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_13830) .cse1 v_ArrVal_13734) .cse2 v_ArrVal_13737) (select (select (store .cse3 .cse2 v_ArrVal_13736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_13739))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_13739 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13738 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13735 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13734 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13737 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13830 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_13831 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_13831))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_13735))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_13736))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_13830) .cse6 v_ArrVal_13734) .cse7 v_ArrVal_13737) .cse8 v_ArrVal_13739) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_13738) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-12-02 18:56:28,553 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-12-02 18:56:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436204262] [2023-12-02 18:56:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436204262] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 18:56:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1452396141] [2023-12-02 18:56:28,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 18:56:28,553 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-02 18:56:28,553 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 [2023-12-02 18:56:28,554 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-02 18:56:28,555 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d6d5bf6e-e445-4e6a-8060-f80aeec084cb/bin/utaipan-verify-nQ1chXbOIh/cvc4 --incremental --print-success --lang smt (63)] Waiting until timeout for monitored process