./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.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_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:45:38,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:45:38,903 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:45:38,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:45:38,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:45:38,929 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:45:38,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:45:38,930 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:45:38,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:45:38,932 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:45:38,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:45:38,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:45:38,934 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:45:38,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:45:38,935 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:45:38,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:45:38,936 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:45:38,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:45:38,937 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:45:38,937 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:45:38,938 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:45:38,939 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:45:38,939 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:45:38,940 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:45:38,940 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:45:38,940 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:45:38,941 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:45:38,941 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:45:38,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:45:38,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:45:38,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:45:38,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:45:38,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:38,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:45:38,944 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:45:38,944 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:45:38,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:45:38,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:45:38,945 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:45:38,945 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:45:38,945 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:45:38,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2023-11-29 04:45:39,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:45:39,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:45:39,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:45:39,169 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:45:39,169 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:45:39,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2023-11-29 04:45:41,911 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:45:42,177 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:45:42,177 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2023-11-29 04:45:42,197 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data/9d3ed75e9/bdf095b26246437d9be7da055ff34fea/FLAGd27e7b159 [2023-11-29 04:45:42,211 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data/9d3ed75e9/bdf095b26246437d9be7da055ff34fea [2023-11-29 04:45:42,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:45:42,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:45:42,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:42,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:45:42,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:45:42,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:42" (1/1) ... [2023-11-29 04:45:42,222 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33eb1702 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:42, skipping insertion in model container [2023-11-29 04:45:42,222 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:42" (1/1) ... [2023-11-29 04:45:42,285 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:45:42,942 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:42,955 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-29 04:45:42,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b5feb7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:42, skipping insertion in model container [2023-11-29 04:45:42,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:42,956 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:45:42,957 INFO L158 Benchmark]: Toolchain (without parser) took 742.08ms. Allocated memory is still 167.8MB. Free memory was 125.5MB in the beginning and 102.6MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 04:45:42,958 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:45:42,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 739.93ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 102.6MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-29 04:45:42,960 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 113.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 739.93ms. Allocated memory is still 167.8MB. Free memory was 125.1MB in the beginning and 102.6MB in the end (delta: 22.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:45:44,714 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:45:44,805 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:45:44,810 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:45:44,811 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:45:44,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:45:44,840 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:45:44,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:45:44,841 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:45:44,841 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:45:44,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:45:44,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:45:44,843 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:45:44,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:45:44,844 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:45:44,845 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:45:44,845 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:45:44,846 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:45:44,846 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:45:44,847 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:45:44,847 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:45:44,848 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:45:44,848 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:45:44,849 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:45:44,849 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:45:44,849 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:45:44,850 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:45:44,850 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:45:44,851 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:45:44,851 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:45:44,851 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:45:44,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:45:44,852 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:45:44,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:45:44,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:44,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:45:44,853 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:45:44,854 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:45:44,854 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:45:44,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:45:44,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:45:44,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:45:44,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:45:44,855 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:45:44,855 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d952a2ac4207d7207b65e88d163e23d18bb81c0593196a835eab903a81ce4e5c [2023-11-29 04:45:45,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:45:45,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:45:45,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:45:45,169 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:45:45,170 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:45:45,171 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2023-11-29 04:45:47,944 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:45:48,227 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:45:48,228 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-2.i [2023-11-29 04:45:48,248 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data/016fe5288/7f2286c84f0f40faacae161138b7e98f/FLAG27103cd78 [2023-11-29 04:45:48,262 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/data/016fe5288/7f2286c84f0f40faacae161138b7e98f [2023-11-29 04:45:48,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:45:48,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:45:48,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:48,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:45:48,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:45:48,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:48" (1/1) ... [2023-11-29 04:45:48,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc194eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:48, skipping insertion in model container [2023-11-29 04:45:48,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:45:48" (1/1) ... [2023-11-29 04:45:48,340 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:45:48,971 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:48,986 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:45:49,013 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:45:49,105 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:49,110 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:45:49,191 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:45:49,265 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 04:45:49,273 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:45:49,274 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49 WrapperNode [2023-11-29 04:45:49,274 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:45:49,275 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:49,275 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:45:49,275 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:45:49,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,385 INFO L138 Inliner]: procedures = 285, calls = 351, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1213 [2023-11-29 04:45:49,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:45:49,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:45:49,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:45:49,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:45:49,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,411 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,549 INFO L175 MemorySlicer]: Split 314 memory accesses to 5 slices as follows [2, 3, 34, 5, 270]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 64 writes are split as follows [0, 2, 4, 1, 57]. [2023-11-29 04:45:49,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,591 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,609 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,631 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:45:49,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:45:49,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:45:49,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:45:49,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (1/1) ... [2023-11-29 04:45:49,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:45:49,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:45:49,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:45:49,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:45:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-11-29 04:45:49,704 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-11-29 04:45:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 04:45:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 04:45:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 04:45:49,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2023-11-29 04:45:49,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:45:49,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:45:49,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2023-11-29 04:45:49,708 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-29 04:45:49,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2023-11-29 04:45:49,708 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:45:49,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 04:45:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 04:45:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 04:45:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 04:45:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2023-11-29 04:45:49,709 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2023-11-29 04:45:49,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:45:49,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:45:49,943 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:45:49,945 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:45:54,836 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:45:55,018 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:45:55,018 INFO L309 CfgBuilder]: Removed 72 assume(true) statements. [2023-11-29 04:45:55,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:55 BoogieIcfgContainer [2023-11-29 04:45:55,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:45:55,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:45:55,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:45:55,026 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:45:55,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:45:48" (1/3) ... [2023-11-29 04:45:55,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55490590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:55, skipping insertion in model container [2023-11-29 04:45:55,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:45:49" (2/3) ... [2023-11-29 04:45:55,027 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55490590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:45:55, skipping insertion in model container [2023-11-29 04:45:55,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:45:55" (3/3) ... [2023-11-29 04:45:55,028 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-2.i [2023-11-29 04:45:55,048 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:45:55,048 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 631 error locations. [2023-11-29 04:45:55,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:45:55,122 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4722d8c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:45:55,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 631 error locations. [2023-11-29 04:45:55,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 1163 states, 507 states have (on average 2.5305719921104535) internal successors, (1283), 1141 states have internal predecessors, (1283), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:45:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:45:55,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:55,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:45:55,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:45:55,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:55,142 INFO L85 PathProgramCache]: Analyzing trace with hash 64540, now seen corresponding path program 1 times [2023-11-29 04:45:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193070698] [2023-11-29 04:45:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:55,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:55,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:55,158 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:55,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 04:45:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:55,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:45:55,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:55,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:45:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:55,419 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:55,419 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193070698] [2023-11-29 04:45:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193070698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:55,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:55,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:45:55,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459936730] [2023-11-29 04:45:55,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:55,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:45:55,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:45:55,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:55,459 INFO L87 Difference]: Start difference. First operand has 1163 states, 507 states have (on average 2.5305719921104535) internal successors, (1283), 1141 states have internal predecessors, (1283), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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-11-29 04:45:57,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:45:57,933 INFO L93 Difference]: Finished difference Result 1400 states and 1492 transitions. [2023-11-29 04:45:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:45:57,936 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-11-29 04:45:57,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:45:57,953 INFO L225 Difference]: With dead ends: 1400 [2023-11-29 04:45:57,953 INFO L226 Difference]: Without dead ends: 1399 [2023-11-29 04:45:57,954 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-11-29 04:45:57,957 INFO L413 NwaCegarLoop]: 757 mSDtfsCounter, 828 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:45:57,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1044 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 04:45:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2023-11-29 04:45:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1176. [2023-11-29 04:45:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 535 states have (on average 2.3626168224299064) internal successors, (1264), 1156 states have internal predecessors, (1264), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 04:45:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1298 transitions. [2023-11-29 04:45:58,035 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1298 transitions. Word has length 2 [2023-11-29 04:45:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:45:58,036 INFO L495 AbstractCegarLoop]: Abstraction has 1176 states and 1298 transitions. [2023-11-29 04:45:58,036 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-11-29 04:45:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1298 transitions. [2023-11-29 04:45:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 04:45:58,036 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:45:58,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 04:45:58,044 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:45:58,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:58,238 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:45:58,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:45:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash 64541, now seen corresponding path program 1 times [2023-11-29 04:45:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:45:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1413248773] [2023-11-29 04:45:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:45:58,239 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:45:58,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:45:58,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:45:58,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 04:45:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:58,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:45:58,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:45:58,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:45:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:45:58,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:45:58,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:45:58,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1413248773] [2023-11-29 04:45:58,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1413248773] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:58,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:58,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:45:58,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738537758] [2023-11-29 04:45:58,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:58,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:45:58,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:45:58,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:45:58,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:45:58,384 INFO L87 Difference]: Start difference. First operand 1176 states and 1298 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-11-29 04:46:02,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:02,066 INFO L93 Difference]: Finished difference Result 1715 states and 1886 transitions. [2023-11-29 04:46:02,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:02,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-11-29 04:46:02,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:02,075 INFO L225 Difference]: With dead ends: 1715 [2023-11-29 04:46:02,076 INFO L226 Difference]: Without dead ends: 1715 [2023-11-29 04:46:02,076 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-11-29 04:46:02,077 INFO L413 NwaCegarLoop]: 865 mSDtfsCounter, 572 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:02,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1449 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 989 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 04:46:02,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2023-11-29 04:46:02,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1346. [2023-11-29 04:46:02,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1346 states, 704 states have (on average 2.3323863636363638) internal successors, (1642), 1324 states have internal predecessors, (1642), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 04:46:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1680 transitions. [2023-11-29 04:46:02,129 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1680 transitions. Word has length 2 [2023-11-29 04:46:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:02,129 INFO L495 AbstractCegarLoop]: Abstraction has 1346 states and 1680 transitions. [2023-11-29 04:46:02,130 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-11-29 04:46:02,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1680 transitions. [2023-11-29 04:46:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 04:46:02,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:02,130 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 04:46:02,132 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 04:46:02,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:02,331 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:02,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:02,332 INFO L85 PathProgramCache]: Analyzing trace with hash -522425799, now seen corresponding path program 1 times [2023-11-29 04:46:02,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366524069] [2023-11-29 04:46:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:02,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:02,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:02,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 04:46:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:02,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:46:02,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:02,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 7 [2023-11-29 04:46:02,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:46:02,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:46:02,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:46:02,606 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:46:02,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:46:02,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:02,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:02,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:02,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366524069] [2023-11-29 04:46:02,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366524069] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:02,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:02,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:02,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680565898] [2023-11-29 04:46:02,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:02,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:02,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:02,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:02,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:02,630 INFO L87 Difference]: Start difference. First operand 1346 states and 1680 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-11-29 04:46:07,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:07,563 INFO L93 Difference]: Finished difference Result 2319 states and 2733 transitions. [2023-11-29 04:46:07,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:07,563 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-11-29 04:46:07,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:07,573 INFO L225 Difference]: With dead ends: 2319 [2023-11-29 04:46:07,573 INFO L226 Difference]: Without dead ends: 2319 [2023-11-29 04:46:07,573 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-11-29 04:46:07,575 INFO L413 NwaCegarLoop]: 559 mSDtfsCounter, 1832 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 1458 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:07,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 1182 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1458 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 04:46:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-11-29 04:46:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1462. [2023-11-29 04:46:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1462 states, 820 states have (on average 2.3121951219512193) internal successors, (1896), 1440 states have internal predecessors, (1896), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 04:46:07,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1462 states to 1462 states and 1934 transitions. [2023-11-29 04:46:07,608 INFO L78 Accepts]: Start accepts. Automaton has 1462 states and 1934 transitions. Word has length 6 [2023-11-29 04:46:07,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:07,609 INFO L495 AbstractCegarLoop]: Abstraction has 1462 states and 1934 transitions. [2023-11-29 04:46:07,609 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-11-29 04:46:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1462 states and 1934 transitions. [2023-11-29 04:46:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:46:07,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:07,610 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:07,613 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 04:46:07,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:07,813 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:07,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash 984669438, now seen corresponding path program 1 times [2023-11-29 04:46:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532130705] [2023-11-29 04:46:07,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:07,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:07,815 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:07,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:07,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 04:46:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:07,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:46:07,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:07,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:46:07,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:07,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:07,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:07,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532130705] [2023-11-29 04:46:07,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532130705] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:07,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:07,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376630762] [2023-11-29 04:46:07,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:07,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:07,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:07,984 INFO L87 Difference]: Start difference. First operand 1462 states and 1934 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-11-29 04:46:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:10,224 INFO L93 Difference]: Finished difference Result 1941 states and 2638 transitions. [2023-11-29 04:46:10,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:10,226 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-11-29 04:46:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:10,234 INFO L225 Difference]: With dead ends: 1941 [2023-11-29 04:46:10,234 INFO L226 Difference]: Without dead ends: 1941 [2023-11-29 04:46:10,235 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-11-29 04:46:10,236 INFO L413 NwaCegarLoop]: 997 mSDtfsCounter, 869 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1335 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:10,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1335 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 04:46:10,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2023-11-29 04:46:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1417. [2023-11-29 04:46:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 820 states have (on average 2.2402439024390244) internal successors, (1837), 1395 states have internal predecessors, (1837), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 04:46:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1875 transitions. [2023-11-29 04:46:10,283 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1875 transitions. Word has length 7 [2023-11-29 04:46:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:10,284 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1875 transitions. [2023-11-29 04:46:10,284 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-11-29 04:46:10,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1875 transitions. [2023-11-29 04:46:10,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:46:10,284 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:10,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:10,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-29 04:46:10,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:10,486 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:10,487 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash 984669439, now seen corresponding path program 1 times [2023-11-29 04:46:10,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:10,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997679917] [2023-11-29 04:46:10,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:10,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:10,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:10,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:10,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 04:46:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:10,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:46:10,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:10,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 5 [2023-11-29 04:46:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:10,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:10,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:10,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997679917] [2023-11-29 04:46:10,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997679917] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:10,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:10,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:10,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907538536] [2023-11-29 04:46:10,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:10,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:10,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:10,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:10,665 INFO L87 Difference]: Start difference. First operand 1417 states and 1875 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-11-29 04:46:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:14,151 INFO L93 Difference]: Finished difference Result 1974 states and 2627 transitions. [2023-11-29 04:46:14,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:14,152 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-11-29 04:46:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:14,159 INFO L225 Difference]: With dead ends: 1974 [2023-11-29 04:46:14,160 INFO L226 Difference]: Without dead ends: 1974 [2023-11-29 04:46:14,160 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-11-29 04:46:14,160 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 620 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:14,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 1600 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 04:46:14,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2023-11-29 04:46:14,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1407. [2023-11-29 04:46:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 820 states have (on average 2.2109756097560975) internal successors, (1813), 1385 states have internal predecessors, (1813), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-29 04:46:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1851 transitions. [2023-11-29 04:46:14,196 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1851 transitions. Word has length 7 [2023-11-29 04:46:14,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:14,197 INFO L495 AbstractCegarLoop]: Abstraction has 1407 states and 1851 transitions. [2023-11-29 04:46:14,197 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-11-29 04:46:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1851 transitions. [2023-11-29 04:46:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:46:14,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:14,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:14,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-29 04:46:14,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:14,399 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:14,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -320660464, now seen corresponding path program 1 times [2023-11-29 04:46:14,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:14,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48843237] [2023-11-29 04:46:14,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:14,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:14,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:14,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:14,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 04:46:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:14,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:46:14,553 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:14,608 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:14,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:14,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48843237] [2023-11-29 04:46:14,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48843237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:14,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:46:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506198611] [2023-11-29 04:46:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:14,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:14,610 INFO L87 Difference]: Start difference. First operand 1407 states and 1851 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:16,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:16,963 INFO L93 Difference]: Finished difference Result 2018 states and 2566 transitions. [2023-11-29 04:46:16,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:46:16,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 04:46:16,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:16,972 INFO L225 Difference]: With dead ends: 2018 [2023-11-29 04:46:16,972 INFO L226 Difference]: Without dead ends: 2018 [2023-11-29 04:46:16,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:16,973 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 682 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 3075 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:16,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 3075 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 04:46:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2018 states. [2023-11-29 04:46:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2018 to 1624. [2023-11-29 04:46:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1624 states, 1034 states have (on average 2.2088974854932304) internal successors, (2284), 1599 states have internal predecessors, (2284), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:46:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1624 states to 1624 states and 2328 transitions. [2023-11-29 04:46:17,010 INFO L78 Accepts]: Start accepts. Automaton has 1624 states and 2328 transitions. Word has length 12 [2023-11-29 04:46:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:17,011 INFO L495 AbstractCegarLoop]: Abstraction has 1624 states and 2328 transitions. [2023-11-29 04:46:17,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:17,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1624 states and 2328 transitions. [2023-11-29 04:46:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:46:17,012 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:17,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:17,014 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-29 04:46:17,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:17,212 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr332REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:17,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:17,213 INFO L85 PathProgramCache]: Analyzing trace with hash -909869265, now seen corresponding path program 1 times [2023-11-29 04:46:17,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:17,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528469298] [2023-11-29 04:46:17,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:17,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:17,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:17,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:17,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 04:46:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:17,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:46:17,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:17,363 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:17,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528469298] [2023-11-29 04:46:17,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528469298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:17,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:17,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:46:17,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378390167] [2023-11-29 04:46:17,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:17,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:17,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:17,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:17,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:17,365 INFO L87 Difference]: Start difference. First operand 1624 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:18,239 INFO L93 Difference]: Finished difference Result 1540 states and 2168 transitions. [2023-11-29 04:46:18,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:18,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 04:46:18,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:18,247 INFO L225 Difference]: With dead ends: 1540 [2023-11-29 04:46:18,247 INFO L226 Difference]: Without dead ends: 1540 [2023-11-29 04:46:18,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:18,247 INFO L413 NwaCegarLoop]: 992 mSDtfsCounter, 70 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:18,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1935 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 04:46:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2023-11-29 04:46:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1540. [2023-11-29 04:46:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1540 states, 974 states have (on average 2.1806981519507187) internal successors, (2124), 1515 states have internal predecessors, (2124), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:46:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 2168 transitions. [2023-11-29 04:46:18,279 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 2168 transitions. Word has length 12 [2023-11-29 04:46:18,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:18,279 INFO L495 AbstractCegarLoop]: Abstraction has 1540 states and 2168 transitions. [2023-11-29 04:46:18,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 2168 transitions. [2023-11-29 04:46:18,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:46:18,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:18,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:18,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 04:46:18,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:18,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:18,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:18,482 INFO L85 PathProgramCache]: Analyzing trace with hash -607253788, now seen corresponding path program 1 times [2023-11-29 04:46:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253461564] [2023-11-29 04:46:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:18,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:18,484 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:18,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 04:46:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:18,682 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:46:18,684 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:18,689 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:46:18,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:46:18,690 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:46:18,695 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-11-29 04:46:18,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:46:18,757 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-11-29 04:46:18,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:18,773 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:18,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:18,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253461564] [2023-11-29 04:46:18,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253461564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:18,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:18,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:46:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240276942] [2023-11-29 04:46:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:18,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:18,776 INFO L87 Difference]: Start difference. First operand 1540 states and 2168 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:21,015 INFO L93 Difference]: Finished difference Result 2237 states and 2664 transitions. [2023-11-29 04:46:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:21,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:46:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:21,025 INFO L225 Difference]: With dead ends: 2237 [2023-11-29 04:46:21,025 INFO L226 Difference]: Without dead ends: 2237 [2023-11-29 04:46:21,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:21,026 INFO L413 NwaCegarLoop]: 1172 mSDtfsCounter, 1011 mSDsluCounter, 2142 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 3314 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:21,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 3314 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 04:46:21,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2023-11-29 04:46:21,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 1273. [2023-11-29 04:46:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1273 states, 709 states have (on average 2.1763046544428772) internal successors, (1543), 1250 states have internal predecessors, (1543), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:46:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1273 states to 1273 states and 1583 transitions. [2023-11-29 04:46:21,050 INFO L78 Accepts]: Start accepts. Automaton has 1273 states and 1583 transitions. Word has length 15 [2023-11-29 04:46:21,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:21,050 INFO L495 AbstractCegarLoop]: Abstraction has 1273 states and 1583 transitions. [2023-11-29 04:46:21,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1273 states and 1583 transitions. [2023-11-29 04:46:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 04:46:21,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:21,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:21,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 04:46:21,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:21,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:21,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:21,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1442573483, now seen corresponding path program 1 times [2023-11-29 04:46:21,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:21,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034178873] [2023-11-29 04:46:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:21,256 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:21,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:21,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:21,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 04:46:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:21,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 04:46:21,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:21,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:21,472 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:21,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:21,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034178873] [2023-11-29 04:46:21,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034178873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:21,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:21,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:46:21,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855239748] [2023-11-29 04:46:21,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:21,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:46:21,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:21,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:46:21,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:21,474 INFO L87 Difference]: Start difference. First operand 1273 states and 1583 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:22,318 INFO L93 Difference]: Finished difference Result 1219 states and 1503 transitions. [2023-11-29 04:46:22,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:22,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 04:46:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:22,324 INFO L225 Difference]: With dead ends: 1219 [2023-11-29 04:46:22,324 INFO L226 Difference]: Without dead ends: 1219 [2023-11-29 04:46:22,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:46:22,325 INFO L413 NwaCegarLoop]: 955 mSDtfsCounter, 70 mSDsluCounter, 906 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1861 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:22,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1861 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 04:46:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2023-11-29 04:46:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1219. [2023-11-29 04:46:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 679 states have (on average 2.154639175257732) internal successors, (1463), 1196 states have internal predecessors, (1463), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:46:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1503 transitions. [2023-11-29 04:46:22,348 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 1503 transitions. Word has length 15 [2023-11-29 04:46:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:22,348 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 1503 transitions. [2023-11-29 04:46:22,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 1503 transitions. [2023-11-29 04:46:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 04:46:22,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:22,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:22,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-29 04:46:22,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:22,549 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:22,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 961317391, now seen corresponding path program 1 times [2023-11-29 04:46:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:22,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997592157] [2023-11-29 04:46:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:22,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:22,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:22,551 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:22,553 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 04:46:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:22,729 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:46:22,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:22,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:22,745 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:22,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997592157] [2023-11-29 04:46:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997592157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:46:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704302315] [2023-11-29 04:46:22,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:22,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:22,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:22,747 INFO L87 Difference]: Start difference. First operand 1219 states and 1503 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:23,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:23,741 INFO L93 Difference]: Finished difference Result 1205 states and 1461 transitions. [2023-11-29 04:46:23,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:23,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 04:46:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:23,747 INFO L225 Difference]: With dead ends: 1205 [2023-11-29 04:46:23,747 INFO L226 Difference]: Without dead ends: 1205 [2023-11-29 04:46:23,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:23,748 INFO L413 NwaCegarLoop]: 924 mSDtfsCounter, 58 mSDsluCounter, 1824 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 2748 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:23,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 2748 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 04:46:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2023-11-29 04:46:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 1203. [2023-11-29 04:46:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 677 states have (on average 2.0960118168389954) internal successors, (1419), 1180 states have internal predecessors, (1419), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:46:23,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1459 transitions. [2023-11-29 04:46:23,765 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1459 transitions. Word has length 17 [2023-11-29 04:46:23,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:23,765 INFO L495 AbstractCegarLoop]: Abstraction has 1203 states and 1459 transitions. [2023-11-29 04:46:23,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:23,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1459 transitions. [2023-11-29 04:46:23,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:46:23,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:23,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:23,769 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 04:46:23,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:23,966 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:23,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:23,966 INFO L85 PathProgramCache]: Analyzing trace with hash 656934686, now seen corresponding path program 1 times [2023-11-29 04:46:23,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:23,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148507990] [2023-11-29 04:46:23,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:23,967 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:23,967 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:23,968 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:23,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 04:46:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:24,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:46:24,141 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:24,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:46:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:24,325 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:24,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:24,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148507990] [2023-11-29 04:46:24,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148507990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:24,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:24,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:46:24,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589331744] [2023-11-29 04:46:24,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:24,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:24,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:24,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:24,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:24,327 INFO L87 Difference]: Start difference. First operand 1203 states and 1459 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:28,833 INFO L93 Difference]: Finished difference Result 1670 states and 2052 transitions. [2023-11-29 04:46:28,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:28,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 04:46:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:28,840 INFO L225 Difference]: With dead ends: 1670 [2023-11-29 04:46:28,840 INFO L226 Difference]: Without dead ends: 1670 [2023-11-29 04:46:28,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:28,841 INFO L413 NwaCegarLoop]: 1124 mSDtfsCounter, 523 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 1640 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:28,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 2238 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1640 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2023-11-29 04:46:28,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2023-11-29 04:46:28,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1199. [2023-11-29 04:46:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 677 states have (on average 2.0841949778434268) internal successors, (1411), 1176 states have internal predecessors, (1411), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:46:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1451 transitions. [2023-11-29 04:46:28,871 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1451 transitions. Word has length 31 [2023-11-29 04:46:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:28,871 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1451 transitions. [2023-11-29 04:46:28,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1451 transitions. [2023-11-29 04:46:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 04:46:28,872 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:28,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:28,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 04:46:29,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:29,073 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:29,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash 656934685, now seen corresponding path program 1 times [2023-11-29 04:46:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609444601] [2023-11-29 04:46:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:29,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:29,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:29,075 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:29,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 04:46:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:29,275 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:46:29,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:29,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-11-29 04:46:29,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:29,346 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:29,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:29,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609444601] [2023-11-29 04:46:29,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609444601] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:29,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:29,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:46:29,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220370474] [2023-11-29 04:46:29,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:29,348 INFO L87 Difference]: Start difference. First operand 1199 states and 1451 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:31,921 INFO L93 Difference]: Finished difference Result 1579 states and 1953 transitions. [2023-11-29 04:46:31,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:31,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 04:46:31,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:31,929 INFO L225 Difference]: With dead ends: 1579 [2023-11-29 04:46:31,929 INFO L226 Difference]: Without dead ends: 1579 [2023-11-29 04:46:31,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:31,930 INFO L413 NwaCegarLoop]: 610 mSDtfsCounter, 754 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1320 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:31,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1386 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 04:46:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2023-11-29 04:46:31,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1195. [2023-11-29 04:46:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1195 states, 677 states have (on average 2.072378138847858) internal successors, (1403), 1172 states have internal predecessors, (1403), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:46:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1443 transitions. [2023-11-29 04:46:31,947 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1443 transitions. Word has length 31 [2023-11-29 04:46:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:31,948 INFO L495 AbstractCegarLoop]: Abstraction has 1195 states and 1443 transitions. [2023-11-29 04:46:31,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1443 transitions. [2023-11-29 04:46:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 04:46:31,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:31,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:31,952 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 04:46:32,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:32,150 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:32,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash 863160283, now seen corresponding path program 1 times [2023-11-29 04:46:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:32,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013262443] [2023-11-29 04:46:32,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:32,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:32,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:32,152 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:32,152 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 04:46:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:32,399 INFO L262 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:46:32,401 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:32,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:32,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013262443] [2023-11-29 04:46:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1013262443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:46:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213928962] [2023-11-29 04:46:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:32,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:32,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:32,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:32,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:32,443 INFO L87 Difference]: Start difference. First operand 1195 states and 1443 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:33,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:33,642 INFO L93 Difference]: Finished difference Result 1183 states and 1423 transitions. [2023-11-29 04:46:33,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:33,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2023-11-29 04:46:33,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:33,648 INFO L225 Difference]: With dead ends: 1183 [2023-11-29 04:46:33,648 INFO L226 Difference]: Without dead ends: 1183 [2023-11-29 04:46:33,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:33,649 INFO L413 NwaCegarLoop]: 918 mSDtfsCounter, 23 mSDsluCounter, 1816 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2734 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:33,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2734 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 04:46:33,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2023-11-29 04:46:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183. [2023-11-29 04:46:33,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 665 states have (on average 2.079699248120301) internal successors, (1383), 1160 states have internal predecessors, (1383), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 04:46:33,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1423 transitions. [2023-11-29 04:46:33,663 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1423 transitions. Word has length 51 [2023-11-29 04:46:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:33,664 INFO L495 AbstractCegarLoop]: Abstraction has 1183 states and 1423 transitions. [2023-11-29 04:46:33,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1423 transitions. [2023-11-29 04:46:33,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 04:46:33,665 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:33,665 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-11-29 04:46:33,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 04:46:33,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:33,866 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:33,866 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:33,866 INFO L85 PathProgramCache]: Analyzing trace with hash 926748, now seen corresponding path program 1 times [2023-11-29 04:46:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:33,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097503059] [2023-11-29 04:46:33,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:33,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:33,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:33,868 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:33,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 04:46:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:34,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:46:34,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:34,210 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2023-11-29 04:46:34,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 04:46:34,260 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 04:46:34,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-11-29 04:46:34,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:34,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:34,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097503059] [2023-11-29 04:46:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097503059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:34,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:46:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895370793] [2023-11-29 04:46:34,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:34,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:46:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:34,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:46:34,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:34,820 INFO L87 Difference]: Start difference. First operand 1183 states and 1423 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:39,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:39,445 INFO L93 Difference]: Finished difference Result 2171 states and 2607 transitions. [2023-11-29 04:46:39,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:46:39,446 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 04:46:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:39,454 INFO L225 Difference]: With dead ends: 2171 [2023-11-29 04:46:39,454 INFO L226 Difference]: Without dead ends: 2171 [2023-11-29 04:46:39,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:46:39,455 INFO L413 NwaCegarLoop]: 739 mSDtfsCounter, 1763 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:39,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 1777 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 04:46:39,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2023-11-29 04:46:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1546. [2023-11-29 04:46:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1546 states, 1012 states have (on average 2.0622529644268774) internal successors, (2087), 1510 states have internal predecessors, (2087), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 04:46:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 2153 transitions. [2023-11-29 04:46:39,476 INFO L78 Accepts]: Start accepts. Automaton has 1546 states and 2153 transitions. Word has length 55 [2023-11-29 04:46:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:39,477 INFO L495 AbstractCegarLoop]: Abstraction has 1546 states and 2153 transitions. [2023-11-29 04:46:39,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:39,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1546 states and 2153 transitions. [2023-11-29 04:46:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 04:46:39,477 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:39,477 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-11-29 04:46:39,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 04:46:39,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:39,678 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:39,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:39,678 INFO L85 PathProgramCache]: Analyzing trace with hash 926749, now seen corresponding path program 1 times [2023-11-29 04:46:39,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:39,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662055148] [2023-11-29 04:46:39,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:39,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:39,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:39,680 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:39,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 04:46:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:40,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:46:40,018 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:40,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:46:40,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:46:40,091 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:46:40,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-29 04:46:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:40,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:40,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662055148] [2023-11-29 04:46:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662055148] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:46:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746645329] [2023-11-29 04:46:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:40,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:46:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:40,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:46:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:40,572 INFO L87 Difference]: Start difference. First operand 1546 states and 2153 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:44,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:44,336 INFO L93 Difference]: Finished difference Result 1551 states and 2159 transitions. [2023-11-29 04:46:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:46:44,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2023-11-29 04:46:44,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:44,342 INFO L225 Difference]: With dead ends: 1551 [2023-11-29 04:46:44,342 INFO L226 Difference]: Without dead ends: 1551 [2023-11-29 04:46:44,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:46:44,342 INFO L413 NwaCegarLoop]: 923 mSDtfsCounter, 0 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1906 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:44,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1906 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 04:46:44,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2023-11-29 04:46:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 1551. [2023-11-29 04:46:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1016 states have (on average 2.0580708661417324) internal successors, (2091), 1514 states have internal predecessors, (2091), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2023-11-29 04:46:44,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2159 transitions. [2023-11-29 04:46:44,369 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2159 transitions. Word has length 55 [2023-11-29 04:46:44,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:44,370 INFO L495 AbstractCegarLoop]: Abstraction has 1551 states and 2159 transitions. [2023-11-29 04:46:44,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:44,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2159 transitions. [2023-11-29 04:46:44,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-29 04:46:44,371 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:44,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:44,376 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-11-29 04:46:44,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:44,571 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:44,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:44,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1243031911, now seen corresponding path program 1 times [2023-11-29 04:46:44,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:44,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992727120] [2023-11-29 04:46:44,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:44,572 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:44,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:44,573 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:44,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 04:46:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:44,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:46:44,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:44,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:44,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:44,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992727120] [2023-11-29 04:46:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992727120] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:44,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:44,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:46:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018079964] [2023-11-29 04:46:44,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:44,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:46:44,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:46:44,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:46:44,956 INFO L87 Difference]: Start difference. First operand 1551 states and 2159 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:46:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:47,002 INFO L93 Difference]: Finished difference Result 1555 states and 2167 transitions. [2023-11-29 04:46:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:46:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2023-11-29 04:46:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:47,010 INFO L225 Difference]: With dead ends: 1555 [2023-11-29 04:46:47,011 INFO L226 Difference]: Without dead ends: 1555 [2023-11-29 04:46:47,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:46:47,012 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 19 mSDsluCounter, 3569 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 4484 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:47,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 4484 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:46:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2023-11-29 04:46:47,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1553. [2023-11-29 04:46:47,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1017 states have (on average 2.057030481809243) internal successors, (2092), 1515 states have internal predecessors, (2092), 36 states have call successors, (36), 10 states have call predecessors, (36), 8 states have return successors, (35), 28 states have call predecessors, (35), 32 states have call successors, (35) [2023-11-29 04:46:47,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2163 transitions. [2023-11-29 04:46:47,037 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2163 transitions. Word has length 59 [2023-11-29 04:46:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:47,038 INFO L495 AbstractCegarLoop]: Abstraction has 1553 states and 2163 transitions. [2023-11-29 04:46:47,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 04:46:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2163 transitions. [2023-11-29 04:46:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2023-11-29 04:46:47,038 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:47,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:47,045 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-29 04:46:47,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:47,239 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:47,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:47,239 INFO L85 PathProgramCache]: Analyzing trace with hash 541184168, now seen corresponding path program 1 times [2023-11-29 04:46:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:47,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296011191] [2023-11-29 04:46:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:47,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:47,240 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:47,241 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:47,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 04:46:47,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:47,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:46:47,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:47,584 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:47,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:47,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296011191] [2023-11-29 04:46:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296011191] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:47,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:46:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115113371] [2023-11-29 04:46:47,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:47,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:46:47,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:47,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:46:47,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:46:47,586 INFO L87 Difference]: Start difference. First operand 1553 states and 2163 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:49,382 INFO L93 Difference]: Finished difference Result 1577 states and 2187 transitions. [2023-11-29 04:46:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:46:49,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2023-11-29 04:46:49,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:49,387 INFO L225 Difference]: With dead ends: 1577 [2023-11-29 04:46:49,387 INFO L226 Difference]: Without dead ends: 1577 [2023-11-29 04:46:49,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:46:49,388 INFO L413 NwaCegarLoop]: 930 mSDtfsCounter, 16 mSDsluCounter, 3713 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4643 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:49,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4643 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 04:46:49,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2023-11-29 04:46:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1573. [2023-11-29 04:46:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1031 states have (on average 2.0475266731328805) internal successors, (2111), 1531 states have internal predecessors, (2111), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-11-29 04:46:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2184 transitions. [2023-11-29 04:46:49,420 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2184 transitions. Word has length 62 [2023-11-29 04:46:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:49,420 INFO L495 AbstractCegarLoop]: Abstraction has 1573 states and 2184 transitions. [2023-11-29 04:46:49,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:46:49,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2184 transitions. [2023-11-29 04:46:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:46:49,421 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:49,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:49,427 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 04:46:49,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:49,622 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:49,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash 498416841, now seen corresponding path program 1 times [2023-11-29 04:46:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896941037] [2023-11-29 04:46:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:49,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:49,624 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:49,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 04:46:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:50,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:46:50,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:50,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:46:50,185 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)))) is different from true [2023-11-29 04:46:50,199 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:46:50,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-11-29 04:46:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:50,208 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:50,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896941037] [2023-11-29 04:46:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896941037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:50,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:46:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168135910] [2023-11-29 04:46:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:50,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:46:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:46:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 04:46:50,210 INFO L87 Difference]: Start difference. First operand 1573 states and 2184 transitions. Second operand has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:46:53,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:53,040 INFO L93 Difference]: Finished difference Result 1956 states and 2692 transitions. [2023-11-29 04:46:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:46:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 04:46:53,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:53,043 INFO L225 Difference]: With dead ends: 1956 [2023-11-29 04:46:53,044 INFO L226 Difference]: Without dead ends: 1956 [2023-11-29 04:46:53,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-11-29 04:46:53,045 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 723 mSDsluCounter, 748 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1401 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:53,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1329 Invalid, 2765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1341 Invalid, 0 Unknown, 1401 Unchecked, 2.8s Time] [2023-11-29 04:46:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2023-11-29 04:46:53,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1572. [2023-11-29 04:46:53,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1031 states have (on average 2.0455868089233755) internal successors, (2109), 1530 states have internal predecessors, (2109), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-11-29 04:46:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2182 transitions. [2023-11-29 04:46:53,076 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2182 transitions. Word has length 64 [2023-11-29 04:46:53,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:53,076 INFO L495 AbstractCegarLoop]: Abstraction has 1572 states and 2182 transitions. [2023-11-29 04:46:53,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 20.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:46:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2182 transitions. [2023-11-29 04:46:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-29 04:46:53,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:53,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:46:53,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 04:46:53,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:53,277 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:46:53,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash 498416842, now seen corresponding path program 1 times [2023-11-29 04:46:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:46:53,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1732343206] [2023-11-29 04:46:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:46:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:46:53,279 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:46:53,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-29 04:46:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:46:53,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 04:46:53,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:46:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:46:53,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:46:54,135 WARN L876 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2023-11-29 04:46:54,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:46:54,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2023-11-29 04:46:54,159 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:46:54,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:46:54,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:46:54,169 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:46:54,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:46:54,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1732343206] [2023-11-29 04:46:54,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1732343206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:46:54,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:46:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:46:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411617634] [2023-11-29 04:46:54,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:46:54,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:46:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:46:54,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:46:54,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-29 04:46:54,171 INFO L87 Difference]: Start difference. First operand 1572 states and 2182 transitions. Second operand has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:00,867 INFO L93 Difference]: Finished difference Result 2515 states and 3479 transitions. [2023-11-29 04:47:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:47:00,868 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 64 [2023-11-29 04:47:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:00,879 INFO L225 Difference]: With dead ends: 2515 [2023-11-29 04:47:00,879 INFO L226 Difference]: Without dead ends: 2515 [2023-11-29 04:47:00,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-11-29 04:47:00,880 INFO L413 NwaCegarLoop]: 965 mSDtfsCounter, 835 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1991 SdHoareTripleChecker+Invalid, 4917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1811 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:00,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1991 Invalid, 4917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 3079 Invalid, 0 Unknown, 1811 Unchecked, 6.6s Time] [2023-11-29 04:47:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2515 states. [2023-11-29 04:47:00,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2515 to 1568. [2023-11-29 04:47:00,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1035 states have (on average 2.026086956521739) internal successors, (2097), 1526 states have internal predecessors, (2097), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-11-29 04:47:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2170 transitions. [2023-11-29 04:47:00,909 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2170 transitions. Word has length 64 [2023-11-29 04:47:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:00,909 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 2170 transitions. [2023-11-29 04:47:00,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 15.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2170 transitions. [2023-11-29 04:47:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 04:47:00,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:00,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:00,919 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Ended with exit code 0 [2023-11-29 04:47:01,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:01,111 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:01,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:01,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1620798592, now seen corresponding path program 1 times [2023-11-29 04:47:01,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:01,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960903507] [2023-11-29 04:47:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:01,113 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:01,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-29 04:47:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:01,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 04:47:01,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:01,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:47:01,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:47:01,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 04:47:01,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:01,506 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:47:01,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960903507] [2023-11-29 04:47:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1960903507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:01,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:47:01,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238576529] [2023-11-29 04:47:01,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:01,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:47:01,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:01,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:47:01,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:47:01,508 INFO L87 Difference]: Start difference. First operand 1568 states and 2170 transitions. Second operand has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:47:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:06,506 INFO L93 Difference]: Finished difference Result 1579 states and 2182 transitions. [2023-11-29 04:47:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:47:06,506 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2023-11-29 04:47:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:06,508 INFO L225 Difference]: With dead ends: 1579 [2023-11-29 04:47:06,508 INFO L226 Difference]: Without dead ends: 1579 [2023-11-29 04:47:06,509 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:47:06,509 INFO L413 NwaCegarLoop]: 917 mSDtfsCounter, 14 mSDsluCounter, 3059 mSDsCounter, 0 mSdLazyCounter, 3263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3976 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:06,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3976 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3263 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2023-11-29 04:47:06,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2023-11-29 04:47:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1578. [2023-11-29 04:47:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1043 states have (on average 2.022051773729626) internal successors, (2109), 1534 states have internal predecessors, (2109), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-11-29 04:47:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2182 transitions. [2023-11-29 04:47:06,529 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2182 transitions. Word has length 70 [2023-11-29 04:47:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:06,529 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 2182 transitions. [2023-11-29 04:47:06,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 04:47:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2182 transitions. [2023-11-29 04:47:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2023-11-29 04:47:06,530 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:06,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:06,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2023-11-29 04:47:06,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:06,731 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:06,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1294851276, now seen corresponding path program 1 times [2023-11-29 04:47:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:06,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [15421443] [2023-11-29 04:47:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:06,732 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:06,733 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:06,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-29 04:47:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:07,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 04:47:07,075 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:07,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:47:07,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:47:07,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:47:07,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 04:47:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:07,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:47:07,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [15421443] [2023-11-29 04:47:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [15421443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:07,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:07,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:47:07,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404694907] [2023-11-29 04:47:07,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:07,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:47:07,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:07,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:47:07,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:47:07,252 INFO L87 Difference]: Start difference. First operand 1578 states and 2182 transitions. Second operand has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:14,239 INFO L93 Difference]: Finished difference Result 1578 states and 2180 transitions. [2023-11-29 04:47:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:47:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2023-11-29 04:47:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:14,243 INFO L225 Difference]: With dead ends: 1578 [2023-11-29 04:47:14,243 INFO L226 Difference]: Without dead ends: 1578 [2023-11-29 04:47:14,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:47:14,244 INFO L413 NwaCegarLoop]: 915 mSDtfsCounter, 12 mSDsluCounter, 3814 mSDsCounter, 0 mSdLazyCounter, 3542 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4729 SdHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:14,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4729 Invalid, 3543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3542 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2023-11-29 04:47:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2023-11-29 04:47:14,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1578. [2023-11-29 04:47:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1043 states have (on average 2.0201342281879193) internal successors, (2107), 1534 states have internal predecessors, (2107), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2023-11-29 04:47:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2180 transitions. [2023-11-29 04:47:14,264 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2180 transitions. Word has length 71 [2023-11-29 04:47:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:14,264 INFO L495 AbstractCegarLoop]: Abstraction has 1578 states and 2180 transitions. [2023-11-29 04:47:14,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-29 04:47:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2180 transitions. [2023-11-29 04:47:14,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-29 04:47:14,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:14,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:14,271 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-11-29 04:47:14,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:14,466 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:14,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:14,467 INFO L85 PathProgramCache]: Analyzing trace with hash 591418728, now seen corresponding path program 1 times [2023-11-29 04:47:14,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:14,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539747149] [2023-11-29 04:47:14,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:14,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:14,468 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:14,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-29 04:47:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:14,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:47:14,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:14,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:14,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:47:14,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:14,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539747149] [2023-11-29 04:47:14,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1539747149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:47:14,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:47:14,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:47:14,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459241460] [2023-11-29 04:47:14,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:47:14,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:47:14,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:14,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:47:14,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:47:14,820 INFO L87 Difference]: Start difference. First operand 1578 states and 2180 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:47:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:16,248 INFO L93 Difference]: Finished difference Result 1586 states and 2190 transitions. [2023-11-29 04:47:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:47:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 76 [2023-11-29 04:47:16,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:16,252 INFO L225 Difference]: With dead ends: 1586 [2023-11-29 04:47:16,252 INFO L226 Difference]: Without dead ends: 1584 [2023-11-29 04:47:16,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:47:16,253 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 4 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:16,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3670 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 04:47:16,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2023-11-29 04:47:16,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1584. [2023-11-29 04:47:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1047 states have (on average 2.018147086914995) internal successors, (2113), 1540 states have internal predecessors, (2113), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:47:16,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2188 transitions. [2023-11-29 04:47:16,269 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2188 transitions. Word has length 76 [2023-11-29 04:47:16,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:16,270 INFO L495 AbstractCegarLoop]: Abstraction has 1584 states and 2188 transitions. [2023-11-29 04:47:16,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-29 04:47:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2188 transitions. [2023-11-29 04:47:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-29 04:47:16,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:16,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:16,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-11-29 04:47:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:16,471 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:16,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:16,471 INFO L85 PathProgramCache]: Analyzing trace with hash -128198608, now seen corresponding path program 1 times [2023-11-29 04:47:16,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:16,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877299606] [2023-11-29 04:47:16,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:47:16,472 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:16,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:16,473 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:16,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-29 04:47:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:47:16,838 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:47:16,840 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:16,881 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:17,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:17,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877299606] [2023-11-29 04:47:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877299606] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:17,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:17,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-29 04:47:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673133185] [2023-11-29 04:47:17,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:17,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:47:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:17,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:47:17,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:47:17,012 INFO L87 Difference]: Start difference. First operand 1584 states and 2188 transitions. Second operand has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:19,087 INFO L93 Difference]: Finished difference Result 1598 states and 2206 transitions. [2023-11-29 04:47:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:47:19,089 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 77 [2023-11-29 04:47:19,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:19,092 INFO L225 Difference]: With dead ends: 1598 [2023-11-29 04:47:19,092 INFO L226 Difference]: Without dead ends: 1594 [2023-11-29 04:47:19,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2023-11-29 04:47:19,093 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 14 mSDsluCounter, 4579 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 5500 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:19,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 5500 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 04:47:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1594 states. [2023-11-29 04:47:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1594 to 1592. [2023-11-29 04:47:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1055 states have (on average 2.0123222748815164) internal successors, (2123), 1548 states have internal predecessors, (2123), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:47:19,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2198 transitions. [2023-11-29 04:47:19,121 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2198 transitions. Word has length 77 [2023-11-29 04:47:19,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:19,121 INFO L495 AbstractCegarLoop]: Abstraction has 1592 states and 2198 transitions. [2023-11-29 04:47:19,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 9.5) internal successors, (76), 10 states have internal predecessors, (76), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:19,121 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2198 transitions. [2023-11-29 04:47:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 04:47:19,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:19,122 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:19,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-29 04:47:19,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:19,322 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:19,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1332660072, now seen corresponding path program 2 times [2023-11-29 04:47:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:19,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678781609] [2023-11-29 04:47:19,324 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:47:19,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:19,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:19,324 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:19,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-29 04:47:19,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:47:19,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:47:19,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:47:19,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:20,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:20,031 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:20,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:20,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678781609] [2023-11-29 04:47:20,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678781609] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:20,335 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:20,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 04:47:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113748589] [2023-11-29 04:47:20,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:20,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:47:20,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:20,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:47:20,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:47:20,343 INFO L87 Difference]: Start difference. First operand 1592 states and 2198 transitions. Second operand has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:23,284 INFO L93 Difference]: Finished difference Result 1616 states and 2236 transitions. [2023-11-29 04:47:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 04:47:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 80 [2023-11-29 04:47:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:23,290 INFO L225 Difference]: With dead ends: 1616 [2023-11-29 04:47:23,290 INFO L226 Difference]: Without dead ends: 1612 [2023-11-29 04:47:23,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2023-11-29 04:47:23,291 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 36 mSDsluCounter, 5501 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 6422 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:23,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 6422 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 04:47:23,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1612 states. [2023-11-29 04:47:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1612 to 1610. [2023-11-29 04:47:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1073 states have (on average 2.000931966449208) internal successors, (2147), 1566 states have internal predecessors, (2147), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:47:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2222 transitions. [2023-11-29 04:47:23,307 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2222 transitions. Word has length 80 [2023-11-29 04:47:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:23,308 INFO L495 AbstractCegarLoop]: Abstraction has 1610 states and 2222 transitions. [2023-11-29 04:47:23,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.857142857142857) internal successors, (82), 16 states have internal predecessors, (82), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:23,308 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2222 transitions. [2023-11-29 04:47:23,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 04:47:23,308 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:23,309 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:23,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2023-11-29 04:47:23,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:23,509 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:23,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash -115633560, now seen corresponding path program 3 times [2023-11-29 04:47:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1545463177] [2023-11-29 04:47:23,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:47:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:23,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:23,511 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:23,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-29 04:47:24,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-29 04:47:24,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:47:24,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 04:47:24,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:24,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:25,476 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:25,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1545463177] [2023-11-29 04:47:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1545463177] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:25,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-11-29 04:47:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210593638] [2023-11-29 04:47:25,477 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:25,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-29 04:47:25,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-29 04:47:25,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:47:25,479 INFO L87 Difference]: Start difference. First operand 1610 states and 2222 transitions. Second operand has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:34,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:34,934 INFO L93 Difference]: Finished difference Result 1652 states and 2294 transitions. [2023-11-29 04:47:34,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-11-29 04:47:34,935 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 86 [2023-11-29 04:47:34,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:34,938 INFO L225 Difference]: With dead ends: 1652 [2023-11-29 04:47:34,938 INFO L226 Difference]: Without dead ends: 1646 [2023-11-29 04:47:34,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2023-11-29 04:47:34,939 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 44 mSDsluCounter, 12832 mSDsCounter, 0 mSdLazyCounter, 2112 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 13753 SdHoareTripleChecker+Invalid, 2123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:34,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 13753 Invalid, 2123 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2112 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2023-11-29 04:47:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1646 states. [2023-11-29 04:47:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1646 to 1646. [2023-11-29 04:47:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1109 states have (on average 1.9774571686203788) internal successors, (2193), 1602 states have internal predecessors, (2193), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:47:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2268 transitions. [2023-11-29 04:47:34,957 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2268 transitions. Word has length 86 [2023-11-29 04:47:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:34,957 INFO L495 AbstractCegarLoop]: Abstraction has 1646 states and 2268 transitions. [2023-11-29 04:47:34,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 28 states have internal predecessors, (94), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2268 transitions. [2023-11-29 04:47:34,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-11-29 04:47:34,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:34,958 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:34,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-11-29 04:47:35,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:35,159 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:35,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1332189080, now seen corresponding path program 4 times [2023-11-29 04:47:35,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:35,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611376563] [2023-11-29 04:47:35,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:47:35,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:35,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:35,161 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:35,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-29 04:47:35,627 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:47:35,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:47:35,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-29 04:47:35,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:36,279 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:36,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:47:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:47:38,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:47:38,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611376563] [2023-11-29 04:47:38,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611376563] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:47:38,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:47:38,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2023-11-29 04:47:38,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103767752] [2023-11-29 04:47:38,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:47:38,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-29 04:47:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:47:38,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-29 04:47:38,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2023-11-29 04:47:38,456 INFO L87 Difference]: Start difference. First operand 1646 states and 2268 transitions. Second operand has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:57,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:47:57,161 INFO L93 Difference]: Finished difference Result 1720 states and 2406 transitions. [2023-11-29 04:47:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-11-29 04:47:57,163 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2023-11-29 04:47:57,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:47:57,165 INFO L225 Difference]: With dead ends: 1720 [2023-11-29 04:47:57,165 INFO L226 Difference]: Without dead ends: 1716 [2023-11-29 04:47:57,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2023-11-29 04:47:57,168 INFO L413 NwaCegarLoop]: 921 mSDtfsCounter, 90 mSDsluCounter, 22921 mSDsCounter, 0 mSdLazyCounter, 4231 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 23842 SdHoareTripleChecker+Invalid, 4275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:47:57,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 23842 Invalid, 4275 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [44 Valid, 4231 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 04:47:57,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2023-11-29 04:47:57,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1714. [2023-11-29 04:47:57,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1177 states have (on average 1.941376380628717) internal successors, (2285), 1670 states have internal predecessors, (2285), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:47:57,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2360 transitions. [2023-11-29 04:47:57,186 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2360 transitions. Word has length 98 [2023-11-29 04:47:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:47:57,187 INFO L495 AbstractCegarLoop]: Abstraction has 1714 states and 2360 transitions. [2023-11-29 04:47:57,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.36) internal successors, (118), 52 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 04:47:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2360 transitions. [2023-11-29 04:47:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:47:57,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:47:57,188 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:47:57,197 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-11-29 04:47:57,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:57,389 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:47:57,389 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:47:57,389 INFO L85 PathProgramCache]: Analyzing trace with hash -632276120, now seen corresponding path program 5 times [2023-11-29 04:47:57,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:47:57,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885009885] [2023-11-29 04:47:57,390 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:47:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:47:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:47:57,391 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:47:57,392 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-29 04:47:58,999 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:47:58,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:47:59,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-29 04:47:59,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:47:59,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:47:59,185 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:47:59,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:47:59,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:47:59,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:48:00,519 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:48:00,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:48:00,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:48:00,619 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:48:00,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:48:01,075 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2690 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2690) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:48:01,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:48:01,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885009885] [2023-11-29 04:48:01,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885009885] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:48:01,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [3604203] [2023-11-29 04:48:01,078 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:48:01,078 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:48:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:48:01,079 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:48:01,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-11-29 04:49:04,011 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2023-11-29 04:49:04,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:49:04,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 68 conjunts are in the unsatisfiable core [2023-11-29 04:49:04,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:04,243 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:49:04,534 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:49:04,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:49:04,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:49:04,747 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-11-29 04:49:05,883 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:49:05,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:49:05,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:49:05,995 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:49:05,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:06,427 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3168 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3168) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:49:06,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [3604203] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:06,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:49:06,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 16 [2023-11-29 04:49:06,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128074424] [2023-11-29 04:49:06,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:49:06,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-29 04:49:06,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:49:06,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-29 04:49:06,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=283, Unknown=2, NotChecked=70, Total=420 [2023-11-29 04:49:06,431 INFO L87 Difference]: Start difference. First operand 1714 states and 2360 transitions. Second operand has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:49:11,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:49:15,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:49:19,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:49:23,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:49:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:49:34,781 INFO L93 Difference]: Finished difference Result 2095 states and 2864 transitions. [2023-11-29 04:49:34,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:49:34,781 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 120 [2023-11-29 04:49:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:49:34,786 INFO L225 Difference]: With dead ends: 2095 [2023-11-29 04:49:34,786 INFO L226 Difference]: Without dead ends: 2095 [2023-11-29 04:49:34,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 224 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=458, Unknown=2, NotChecked=90, Total=650 [2023-11-29 04:49:34,787 INFO L413 NwaCegarLoop]: 568 mSDtfsCounter, 735 mSDsluCounter, 4511 mSDsCounter, 0 mSdLazyCounter, 6158 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 5079 SdHoareTripleChecker+Invalid, 6189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 6158 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:49:34,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 5079 Invalid, 6189 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 6158 Invalid, 4 Unknown, 0 Unchecked, 28.1s Time] [2023-11-29 04:49:34,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2095 states. [2023-11-29 04:49:34,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2095 to 1711. [2023-11-29 04:49:34,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1711 states, 1177 states have (on average 1.9362786745964315) internal successors, (2279), 1667 states have internal predecessors, (2279), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:49:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1711 states to 1711 states and 2354 transitions. [2023-11-29 04:49:34,814 INFO L78 Accepts]: Start accepts. Automaton has 1711 states and 2354 transitions. Word has length 120 [2023-11-29 04:49:34,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:49:34,814 INFO L495 AbstractCegarLoop]: Abstraction has 1711 states and 2354 transitions. [2023-11-29 04:49:34,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 9.846153846153847) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:49:34,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1711 states and 2354 transitions. [2023-11-29 04:49:34,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:49:34,815 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:49:34,815 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:49:34,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-11-29 04:49:35,043 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-11-29 04:49:35,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:49:35,216 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:49:35,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:49:35,217 INFO L85 PathProgramCache]: Analyzing trace with hash -632276119, now seen corresponding path program 1 times [2023-11-29 04:49:35,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:49:35,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312404473] [2023-11-29 04:49:35,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:35,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:49:35,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:49:35,222 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:49:35,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-29 04:49:36,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:49:36,112 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 116 conjunts are in the unsatisfiable core [2023-11-29 04:49:36,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:49:36,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:49:36,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:49:36,293 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:49:36,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:49:36,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:49:36,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:49:36,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 04:49:36,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:49:37,461 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:49:37,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:49:37,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:49:37,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 04:49:37,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:49:37,567 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:49:37,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:49:39,142 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_3737 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_3736 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3737 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:49:39,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:49:39,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312404473] [2023-11-29 04:49:39,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312404473] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:49:39,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095381832] [2023-11-29 04:49:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:49:39,149 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:49:39,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:49:39,150 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:49:39,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2023-11-29 04:51:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:12,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 04:51:12,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:12,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:51:12,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:51:12,938 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:51:12,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:51:13,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:51:13,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:51:13,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:51:13,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:51:14,024 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:14,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:51:14,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:51:14,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 25 treesize of output 13 [2023-11-29 04:51:14,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 7 treesize of output 3 [2023-11-29 04:51:14,120 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:51:14,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:15,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4306) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_4306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4305 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4306) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4305) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:51:15,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2095381832] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:51:15,499 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:51:15,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2023-11-29 04:51:15,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165183140] [2023-11-29 04:51:15,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:51:15,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 04:51:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:15,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 04:51:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=327, Unknown=2, NotChecked=74, Total=462 [2023-11-29 04:51:15,501 INFO L87 Difference]: Start difference. First operand 1711 states and 2354 transitions. Second operand has 18 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:51:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:51:41,219 INFO L93 Difference]: Finished difference Result 2613 states and 3579 transitions. [2023-11-29 04:51:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:51:41,219 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 120 [2023-11-29 04:51:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:51:41,222 INFO L225 Difference]: With dead ends: 2613 [2023-11-29 04:51:41,222 INFO L226 Difference]: Without dead ends: 2613 [2023-11-29 04:51:41,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 223 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=112, Invalid=596, Unknown=2, NotChecked=102, Total=812 [2023-11-29 04:51:41,222 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1188 mSDsluCounter, 5999 mSDsCounter, 0 mSdLazyCounter, 13268 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 6794 SdHoareTripleChecker+Invalid, 13299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:51:41,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 6794 Invalid, 13299 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 13268 Invalid, 0 Unknown, 0 Unchecked, 25.2s Time] [2023-11-29 04:51:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2023-11-29 04:51:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 1710. [2023-11-29 04:51:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1177 states have (on average 1.9345794392523366) internal successors, (2277), 1666 states have internal predecessors, (2277), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:51:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2352 transitions. [2023-11-29 04:51:41,250 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2352 transitions. Word has length 120 [2023-11-29 04:51:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:51:41,251 INFO L495 AbstractCegarLoop]: Abstraction has 1710 states and 2352 transitions. [2023-11-29 04:51:41,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 9.142857142857142) internal successors, (128), 14 states have internal predecessors, (128), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:51:41,251 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2352 transitions. [2023-11-29 04:51:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 04:51:41,252 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:51:41,252 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:51:41,265 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Ended with exit code 0 [2023-11-29 04:51:41,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2023-11-29 04:51:41,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:51:41,653 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:51:41,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:51:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -2025310281, now seen corresponding path program 1 times [2023-11-29 04:51:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:51:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205826978] [2023-11-29 04:51:41,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:41,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:51:41,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:51:41,655 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:51:41,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-29 04:51:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:42,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-29 04:51:42,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:42,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:51:42,699 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:51:42,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:51:42,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:51:42,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:51:43,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:51:43,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:51:44,064 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:51:44,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:51:44,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:51:44,122 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:51:44,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:44,192 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4745) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:51:44,204 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4745) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:51:44,643 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4745 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4791 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4791))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4745)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:51:44,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:51:44,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205826978] [2023-11-29 04:51:44,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205826978] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:51:44,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [188303825] [2023-11-29 04:51:44,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:51:44,647 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:51:44,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:51:44,648 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:51:44,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-11-29 04:51:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:51:49,796 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 04:51:49,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:51:49,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:51:50,074 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:51:50,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:51:50,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:51:50,273 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-11-29 04:51:51,235 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:51,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:51:51,383 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:51:51,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:51:51,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:51:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:51:51,407 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:51:51,421 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5230 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5230) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 04:51:55,938 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5230 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5276 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5276))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5230)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:51:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [188303825] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:51:55,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:51:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2023-11-29 04:51:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417789365] [2023-11-29 04:51:55,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:51:55,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 04:51:55,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:51:55,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 04:51:55,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=378, Unknown=12, NotChecked=220, Total=702 [2023-11-29 04:51:55,943 INFO L87 Difference]: Start difference. First operand 1710 states and 2352 transitions. Second operand has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:52:00,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:52:04,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:52:08,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:52:12,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:52:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:52:22,576 INFO L93 Difference]: Finished difference Result 2093 states and 2860 transitions. [2023-11-29 04:52:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 04:52:22,581 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 122 [2023-11-29 04:52:22,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:52:22,583 INFO L225 Difference]: With dead ends: 2093 [2023-11-29 04:52:22,583 INFO L226 Difference]: Without dead ends: 2093 [2023-11-29 04:52:22,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=128, Invalid=578, Unknown=16, NotChecked=270, Total=992 [2023-11-29 04:52:22,584 INFO L413 NwaCegarLoop]: 567 mSDtfsCounter, 1369 mSDsluCounter, 3451 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 29 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1371 SdHoareTripleChecker+Valid, 4018 SdHoareTripleChecker+Invalid, 4919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:52:22,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1371 Valid, 4018 Invalid, 4919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4886 Invalid, 4 Unknown, 0 Unchecked, 26.3s Time] [2023-11-29 04:52:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2023-11-29 04:52:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1709. [2023-11-29 04:52:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1177 states have (on average 1.9328802039082413) internal successors, (2275), 1665 states have internal predecessors, (2275), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:52:22,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2350 transitions. [2023-11-29 04:52:22,609 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2350 transitions. Word has length 122 [2023-11-29 04:52:22,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:52:22,609 INFO L495 AbstractCegarLoop]: Abstraction has 1709 states and 2350 transitions. [2023-11-29 04:52:22,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 8.8) internal successors, (132), 16 states have internal predecessors, (132), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:52:22,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2350 transitions. [2023-11-29 04:52:22,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 04:52:22,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:52:22,610 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:52:22,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-11-29 04:52:22,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-11-29 04:52:23,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:23,011 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:52:23,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:52:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2025310280, now seen corresponding path program 1 times [2023-11-29 04:52:23,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:52:23,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560067506] [2023-11-29 04:52:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:23,013 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:52:23,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:52:23,013 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:52:23,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-29 04:52:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:24,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 119 conjunts are in the unsatisfiable core [2023-11-29 04:52:24,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:24,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:52:24,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:52:24,258 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:52:24,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:52:24,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:52:24,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:52:24,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 04:52:24,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:52:25,549 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:25,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:52:25,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:52:25,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:52:25,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:52:25,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:52:25,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 04:52:25,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:52:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:52:25,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:25,949 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:52:25,986 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_5760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_5760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:52:27,463 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5852) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5853) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5852 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5853 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5760 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5761 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5853))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5852) .cse2 v_ArrVal_5761) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_5760) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:52:27,472 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:52:27,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560067506] [2023-11-29 04:52:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560067506] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:52:27,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [583762224] [2023-11-29 04:52:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:52:27,473 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:52:27,473 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:52:27,474 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:52:27,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-11-29 04:52:33,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:52:33,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 83 conjunts are in the unsatisfiable core [2023-11-29 04:52:33,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:52:33,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:52:33,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:52:33,733 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:52:33,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:52:33,740 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 12 treesize of output 14 [2023-11-29 04:52:33,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:52:33,836 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 15 treesize of output 1 [2023-11-29 04:52:33,949 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 17 treesize of output 9 [2023-11-29 04:52:34,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:52:35,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:52:35,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 04:52:35,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 42 [2023-11-29 04:52:35,416 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 35 treesize of output 11 [2023-11-29 04:52:35,582 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 17 treesize of output 9 [2023-11-29 04:52:35,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:52:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:52:35,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:52:36,125 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 231 treesize of output 159 [2023-11-29 04:52:38,619 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_6343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6343))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_ArrVal_6295 (_ BitVec 32))) (let ((.cse0 (select (select (store .cse1 v_arrayElimCell_76 (store (select .cse1 v_arrayElimCell_76) (bvadd (_ bv16 32) .cse2) v_ArrVal_6295)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (bvule (bvadd .cse2 (_ bv20 32)) (select |c_#length| v_arrayElimCell_76))))))) (forall ((v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_6343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6343))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse6 (select |c_#length| v_arrayElimCell_76))) (or (forall ((v_prenex_6 (_ BitVec 32))) (bvule (bvadd (select (select (store .cse4 v_arrayElimCell_76 (store (select .cse4 v_arrayElimCell_76) (bvadd (_ bv16 32) .cse5) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) .cse6)) (= |c_ULTIMATE.start_main_~user~0#1.base| v_arrayElimCell_76) (not (bvule (bvadd .cse5 (_ bv20 32)) .cse6)))))) (forall ((v_ArrVal_6343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6343))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (or (forall ((v_arrayElimCell_76 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse9 (select |c_#length| v_arrayElimCell_76))) (or (bvule (bvadd (select (select (store .cse7 v_arrayElimCell_76 (store (select .cse7 v_arrayElimCell_76) (bvadd (_ bv16 32) .cse8) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) .cse9) (not (bvule (bvadd .cse8 (_ bv20 32)) .cse9))))) (= (bvadd .cse8 (_ bv8 32)) |c_ULTIMATE.start_main_~user~0#1.offset|))))) (forall ((v_arrayElimCell_76 (_ BitVec 32)) (v_ArrVal_6343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6343))) (let ((.cse13 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)) (.cse11 (select |c_#length| v_arrayElimCell_76))) (or (forall ((v_prenex_6 (_ BitVec 32))) (let ((.cse10 (bvadd (select (select (store .cse12 v_arrayElimCell_76 (store (select .cse12 v_arrayElimCell_76) (bvadd (_ bv16 32) .cse13) v_prenex_6)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)))) (or (bvule .cse10 .cse11) (forall ((v_ArrVal_6297 (_ BitVec 32))) (bvule .cse10 (select |c_#length| v_ArrVal_6297)))))) (not (bvule (bvadd .cse13 (_ bv20 32)) .cse11)))))) (forall ((v_ArrVal_6343 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6343) |c_ULTIMATE.start_main_~user~0#1.base|))) (let ((.cse14 (select .cse15 .cse3))) (or (not (= (bvadd .cse14 (_ bv8 32)) |c_ULTIMATE.start_main_~user~0#1.offset|)) (forall ((v_ArrVal_6297 (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (store .cse15 (bvadd (_ bv16 32) .cse14) v_prenex_6) .cse3)) (select |c_#length| v_ArrVal_6297))) (not (bvule (bvadd .cse14 (_ bv20 32)) (select |c_#length| |c_ULTIMATE.start_main_~user~0#1.base|))))))))) is different from false [2023-11-29 04:52:38,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [583762224] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:52:38,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:52:38,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 29 [2023-11-29 04:52:38,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335630660] [2023-11-29 04:52:38,855 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:52:38,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-29 04:52:38,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:52:38,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-29 04:52:38,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1021, Unknown=4, NotChecked=268, Total=1406 [2023-11-29 04:52:38,857 INFO L87 Difference]: Start difference. First operand 1709 states and 2350 transitions. Second operand has 30 states, 25 states have (on average 5.76) internal successors, (144), 24 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:53:26,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:53:26,142 INFO L93 Difference]: Finished difference Result 2611 states and 3575 transitions. [2023-11-29 04:53:26,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:53:26,143 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 5.76) internal successors, (144), 24 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 122 [2023-11-29 04:53:26,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:53:26,145 INFO L225 Difference]: With dead ends: 2611 [2023-11-29 04:53:26,145 INFO L226 Difference]: Without dead ends: 2611 [2023-11-29 04:53:26,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=203, Invalid=1531, Unknown=4, NotChecked=332, Total=2070 [2023-11-29 04:53:26,146 INFO L413 NwaCegarLoop]: 672 mSDtfsCounter, 1200 mSDsluCounter, 7859 mSDsCounter, 0 mSdLazyCounter, 20145 mSolverCounterSat, 35 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 8531 SdHoareTripleChecker+Invalid, 20184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 20145 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:53:26,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 8531 Invalid, 20184 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [35 Valid, 20145 Invalid, 4 Unknown, 0 Unchecked, 45.9s Time] [2023-11-29 04:53:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2023-11-29 04:53:26,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 1708. [2023-11-29 04:53:26,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1177 states have (on average 1.9311809685641461) internal successors, (2273), 1664 states have internal predecessors, (2273), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:53:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2348 transitions. [2023-11-29 04:53:26,164 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2348 transitions. Word has length 122 [2023-11-29 04:53:26,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:53:26,164 INFO L495 AbstractCegarLoop]: Abstraction has 1708 states and 2348 transitions. [2023-11-29 04:53:26,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 5.76) internal successors, (144), 24 states have internal predecessors, (144), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-29 04:53:26,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2348 transitions. [2023-11-29 04:53:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 04:53:26,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:53:26,165 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:53:26,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Ended with exit code 0 [2023-11-29 04:53:26,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (35)] Ended with exit code 0 [2023-11-29 04:53:26,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:53:26,566 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:53:26,566 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:53:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash -701347231, now seen corresponding path program 1 times [2023-11-29 04:53:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:53:26,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192403062] [2023-11-29 04:53:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:26,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:53:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:53:26,568 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:53:26,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-11-29 04:53:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:27,667 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 04:53:27,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:27,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:53:27,872 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:53:27,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:53:27,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:53:28,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:53:29,269 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:53:29,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:53:29,421 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:53:29,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:53:29,531 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:53:29,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:53:29,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:53:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:53:29,603 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:29,689 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_6798) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:53:31,886 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6798 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6797))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6798)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:53:31,902 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6798 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6797))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6798)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:32,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6844 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6798 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6844))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6797)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6798)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:32,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:53:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192403062] [2023-11-29 04:53:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192403062] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1252390341] [2023-11-29 04:53:32,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:53:32,441 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:53:32,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:53:32,442 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:53:32,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-11-29 04:53:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:53:41,409 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 04:53:41,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:53:41,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:53:41,733 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:53:41,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:53:41,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:53:41,979 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-11-29 04:53:43,011 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:43,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:43,211 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:43,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:43,318 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:53:43,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:53:43,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:53:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:53:43,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:53:47,458 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7299) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:53:47,472 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7299 (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$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7298))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7299)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:53:47,491 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7299 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7298))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7299)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:53:47,907 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7299 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7345 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7345))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7298)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7299)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:53:47,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1252390341] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:53:47,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:53:47,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2023-11-29 04:53:47,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004662428] [2023-11-29 04:53:47,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:53:47,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 04:53:47,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:53:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 04:53:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=500, Unknown=14, NotChecked=424, Total=1056 [2023-11-29 04:53:47,912 INFO L87 Difference]: Start difference. First operand 1708 states and 2348 transitions. Second operand has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:53:52,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:53:57,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:01,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:05,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:54:22,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:54:22,490 INFO L93 Difference]: Finished difference Result 2091 states and 2856 transitions. [2023-11-29 04:54:22,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 04:54:22,490 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-11-29 04:54:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:54:22,492 INFO L225 Difference]: With dead ends: 2091 [2023-11-29 04:54:22,492 INFO L226 Difference]: Without dead ends: 2091 [2023-11-29 04:54:22,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 228 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=154, Invalid=734, Unknown=14, NotChecked=504, Total=1406 [2023-11-29 04:54:22,493 INFO L413 NwaCegarLoop]: 566 mSDtfsCounter, 725 mSDsluCounter, 6270 mSDsCounter, 0 mSdLazyCounter, 8480 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 6836 SdHoareTripleChecker+Invalid, 8509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 8480 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:54:22,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 6836 Invalid, 8509 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [25 Valid, 8480 Invalid, 4 Unknown, 0 Unchecked, 34.2s Time] [2023-11-29 04:54:22,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2023-11-29 04:54:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1707. [2023-11-29 04:54:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1177 states have (on average 1.929481733220051) internal successors, (2271), 1663 states have internal predecessors, (2271), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:54:22,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2346 transitions. [2023-11-29 04:54:22,515 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2346 transitions. Word has length 124 [2023-11-29 04:54:22,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:54:22,515 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2346 transitions. [2023-11-29 04:54:22,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:54:22,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2346 transitions. [2023-11-29 04:54:22,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 04:54:22,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:54:22,516 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:54:22,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-11-29 04:54:22,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Ended with exit code 0 [2023-11-29 04:54:22,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:54:22,917 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:54:22,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:54:22,918 INFO L85 PathProgramCache]: Analyzing trace with hash -701347230, now seen corresponding path program 1 times [2023-11-29 04:54:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:54:22,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2079102274] [2023-11-29 04:54:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:22,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:54:22,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:54:22,920 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:54:22,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-11-29 04:54:24,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:54:24,103 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 122 conjunts are in the unsatisfiable core [2023-11-29 04:54:24,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:54:24,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:54:24,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 5 [2023-11-29 04:54:24,327 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:54:24,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:54:24,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:54:24,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:54:24,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 04:54:24,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:54:25,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:54:25,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:54:25,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:54:25,674 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:54:25,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:54:25,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:54:25,786 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:54:25,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:54:25,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:54:25,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 04:54:25,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:54:25,858 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:54:25,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:54:26,085 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:54:26,121 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_7847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd .cse2 (_ bv12 32)))))))) is different from false [2023-11-29 04:54:26,173 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7845))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7844) .cse0 v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7844) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32))))))) is different from false [2023-11-29 04:54:26,274 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7844) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_7845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_7845))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_7844) .cse3 v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_7847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:54:28,621 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_7939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7847 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7939))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_7845))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7938) .cse0 v_ArrVal_7844) .cse1 v_ArrVal_7846) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_7847) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_7939 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7846 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7845 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7844 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7939))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7938) .cse6 v_ArrVal_7844) (select (select (store .cse7 .cse6 v_ArrVal_7845) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7846))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 04:54:28,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:54:28,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2079102274] [2023-11-29 04:54:28,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2079102274] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:54:28,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1160871894] [2023-11-29 04:54:28,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:54:28,637 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:54:28,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:54:28,638 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:54:28,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-11-29 04:56:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:56:51,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 924 conjuncts, 124 conjunts are in the unsatisfiable core [2023-11-29 04:56:51,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:56:51,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:56:51,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:56:51,879 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:56:51,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:56:52,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:56:52,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:56:52,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-11-29 04:56:52,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:56:53,758 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:56:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:56:53,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:56:54,086 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:56:54,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:56:54,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:56:54,308 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:56:54,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 04:56:54,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 04:56:54,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 04:56:54,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 04:56:54,362 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:56:54,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:56:54,440 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (bvule (bvadd (_ bv8 32) .cse1) (bvadd .cse1 (_ bv12 32))))))) is different from false [2023-11-29 04:56:54,484 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))) is different from false [2023-11-29 04:56:54,628 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8438) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8439) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8439))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8438) .cse2 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))))) is different from false [2023-11-29 04:56:54,735 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8438) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8439) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_8439))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_8438) .cse3 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:56:56,915 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_8441 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8532))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_8439))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8533) .cse0 v_ArrVal_8438) .cse1 v_ArrVal_8440) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8441) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8440 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8439 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8438 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8533 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8532 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8532))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8533) .cse6 v_ArrVal_8438) (select (select (store .cse7 .cse6 v_ArrVal_8439) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_8440))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (_ bv8 32) .cse5) (bvadd .cse5 (_ bv12 32))))))) is different from false [2023-11-29 04:56:56,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1160871894] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:56:56,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:56:56,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2023-11-29 04:56:56,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813233410] [2023-11-29 04:56:56,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:56:56,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 04:56:56,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:56:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 04:56:56,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=487, Unknown=10, NotChecked=530, Total=1122 [2023-11-29 04:56:56,930 INFO L87 Difference]: Start difference. First operand 1707 states and 2346 transitions. Second operand has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:57:32,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:57:32,746 INFO L93 Difference]: Finished difference Result 2609 states and 3571 transitions. [2023-11-29 04:57:32,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:57:32,747 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 124 [2023-11-29 04:57:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:57:32,750 INFO L225 Difference]: With dead ends: 2609 [2023-11-29 04:57:32,751 INFO L226 Difference]: Without dead ends: 2609 [2023-11-29 04:57:32,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 227 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=168, Invalid=918, Unknown=10, NotChecked=710, Total=1806 [2023-11-29 04:57:32,752 INFO L413 NwaCegarLoop]: 794 mSDtfsCounter, 1128 mSDsluCounter, 4663 mSDsCounter, 0 mSdLazyCounter, 10604 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 5457 SdHoareTripleChecker+Invalid, 10631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 10604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:57:32,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 5457 Invalid, 10631 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [27 Valid, 10604 Invalid, 0 Unknown, 0 Unchecked, 34.9s Time] [2023-11-29 04:57:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2609 states. [2023-11-29 04:57:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2609 to 1706. [2023-11-29 04:57:32,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1706 states, 1177 states have (on average 1.927782497875956) internal successors, (2269), 1662 states have internal predecessors, (2269), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:57:32,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 2344 transitions. [2023-11-29 04:57:32,774 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 2344 transitions. Word has length 124 [2023-11-29 04:57:32,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:57:32,774 INFO L495 AbstractCegarLoop]: Abstraction has 1706 states and 2344 transitions. [2023-11-29 04:57:32,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 7.555555555555555) internal successors, (136), 18 states have internal predecessors, (136), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:57:32,775 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 2344 transitions. [2023-11-29 04:57:32,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 04:57:32,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:57:32,775 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:57:32,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (39)] Ended with exit code 0 [2023-11-29 04:57:32,985 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Ended with exit code 0 [2023-11-29 04:57:33,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt,38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:33,176 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:57:33,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:57:33,177 INFO L85 PathProgramCache]: Analyzing trace with hash 316818661, now seen corresponding path program 1 times [2023-11-29 04:57:33,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:57:33,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88085137] [2023-11-29 04:57:33,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:33,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:57:33,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:57:33,178 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:57:33,179 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2023-11-29 04:57:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:34,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-29 04:57:34,436 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:57:34,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:57:34,773 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:57:34,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:57:34,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:57:35,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 04:57:36,973 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:57:36,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:57:37,215 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:57:37,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:57:37,386 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:57:37,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-11-29 04:57:37,568 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:57:37,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 04:57:37,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 04:57:37,691 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:57:37,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:57:41,996 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9004 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9004) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:57:42,017 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (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$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9003))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9004)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:57:42,039 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9003))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9004)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:57:42,064 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (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$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9002))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9003)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9004)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:57:42,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9002))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9003)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9004)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:57:42,726 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9002 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9050 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9004 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9003 (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$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9050))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9002)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9003)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9004)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:57:42,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:57:42,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88085137] [2023-11-29 04:57:42,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88085137] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:57:42,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1049972740] [2023-11-29 04:57:42,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:57:42,733 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:57:42,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:57:42,734 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:57:42,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2023-11-29 04:57:50,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:57:50,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-29 04:57:50,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:57:50,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:57:50,942 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 04:57:50,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 04:57:51,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:57:51,394 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-11-29 04:57:53,170 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:57:53,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:57:53,521 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:57:53,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:57:53,742 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:57:53,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:57:53,947 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:57:53,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 04:57:53,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-29 04:57:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:57:53,996 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:57:54,023 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_9521) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:57:54,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9521) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2023-11-29 04:57:54,066 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9520))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9521)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:57:54,094 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9520 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9520))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9521)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2023-11-29 04:57:54,119 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9519))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9520)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9521)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:57:54,146 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9520 (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$#4.base| (select (select |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9519))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9520)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9521)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 04:57:54,760 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9567 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9520 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9567))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9519)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9520)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9521)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (_ bv0 1))) is different from false [2023-11-29 04:57:54,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1049972740] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:57:54,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:57:54,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2023-11-29 04:57:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280640945] [2023-11-29 04:57:54,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:57:54,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:57:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:57:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:57:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=556, Unknown=16, NotChecked=780, Total=1482 [2023-11-29 04:57:54,768 INFO L87 Difference]: Start difference. First operand 1706 states and 2344 transitions. Second operand has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:57:59,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:58:03,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:58:07,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:58:11,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:58:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:58:31,447 INFO L93 Difference]: Finished difference Result 2089 states and 2852 transitions. [2023-11-29 04:58:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 04:58:31,448 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 126 [2023-11-29 04:58:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:58:31,451 INFO L225 Difference]: With dead ends: 2089 [2023-11-29 04:58:31,451 INFO L226 Difference]: Without dead ends: 2089 [2023-11-29 04:58:31,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 230 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=165, Invalid=801, Unknown=16, NotChecked=910, Total=1892 [2023-11-29 04:58:31,452 INFO L413 NwaCegarLoop]: 565 mSDtfsCounter, 1351 mSDsluCounter, 3880 mSDsCounter, 0 mSdLazyCounter, 5506 mSolverCounterSat, 30 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 4445 SdHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5506 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:58:31,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 4445 Invalid, 5540 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [30 Valid, 5506 Invalid, 4 Unknown, 0 Unchecked, 36.2s Time] [2023-11-29 04:58:31,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2023-11-29 04:58:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1705. [2023-11-29 04:58:31,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1177 states have (on average 1.9260832625318607) internal successors, (2267), 1661 states have internal predecessors, (2267), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2023-11-29 04:58:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2342 transitions. [2023-11-29 04:58:31,478 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2342 transitions. Word has length 126 [2023-11-29 04:58:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:58:31,479 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2342 transitions. [2023-11-29 04:58:31,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 7.368421052631579) internal successors, (140), 20 states have internal predecessors, (140), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-29 04:58:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2342 transitions. [2023-11-29 04:58:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-11-29 04:58:31,480 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:58:31,480 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:58:31,490 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (40)] Ended with exit code 0 [2023-11-29 04:58:31,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (41)] Ended with exit code 0 [2023-11-29 04:58:31,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,41 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt [2023-11-29 04:58:31,881 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 628 more)] === [2023-11-29 04:58:31,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:58:31,881 INFO L85 PathProgramCache]: Analyzing trace with hash 316818662, now seen corresponding path program 1 times [2023-11-29 04:58:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:58:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557787295] [2023-11-29 04:58:31,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:31,882 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 04:58:31,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:58:31,883 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 04:58:31,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2023-11-29 04:58:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:58:33,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 125 conjunts are in the unsatisfiable core [2023-11-29 04:58:33,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:58:33,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-29 04:58:33,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:58:33,678 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 04:58:33,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 04:58:33,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 04:58:33,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 04:58:33,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-11-29 04:58:33,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:58:35,689 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:58:35,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:58:35,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:58:35,937 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:58:35,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:58:35,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:58:36,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:58:36,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 04:58:36,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:58:36,322 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 04:58:36,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-11-29 04:58:36,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 04:58:36,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 04:58:36,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 04:58:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2023-11-29 04:58:36,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:58:36,745 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2023-11-29 04:58:36,787 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#4.base| .cse0 v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#4.offset| .cse0 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))))) is different from false [2023-11-29 04:58:36,841 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10084))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10083) .cse0 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10083) (select (select (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (_ bv20 32) .cse3) (bvadd .cse3 (_ bv24 32))))))) is different from false [2023-11-29 04:58:36,896 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_10083) (select (select (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_10084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_10084))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_10083) .cse3 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))))))) is different from false [2023-11-29 04:58:36,969 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10082))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10084))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10081) .cse0 v_ArrVal_10083) .cse1 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10082))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10081) .cse6 v_ArrVal_10083) (select (select (store .cse7 .cse6 v_ArrVal_10084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10085))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32))))))) is different from false [2023-11-29 04:58:37,035 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$#4.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_10082))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_10081) .cse2 v_ArrVal_10083) (select (select (store .cse3 .cse2 v_ArrVal_10084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10085))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$#4.base| .cse1 v_ArrVal_10082))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_10084))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$#4.offset| .cse1 v_ArrVal_10081) .cse5 v_ArrVal_10083) .cse6 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))))))))))) is different from false [2023-11-29 04:58:38,651 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (and (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10178))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10082))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10177) .cse1 v_ArrVal_10081) .cse2 v_ArrVal_10083) (select (select (store .cse3 .cse2 v_ArrVal_10084) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10085))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (bvule (bvadd (_ bv20 32) .cse0) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10085 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10086 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10177 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10178 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10083 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10084 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10082 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$#4.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10178))) (let ((.cse6 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse10 (store .cse11 .cse6 v_ArrVal_10082))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_10084))) (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$#4.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10177) .cse6 v_ArrVal_10081) .cse7 v_ArrVal_10083) .cse8 v_ArrVal_10085) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_10086) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))))))))))) is different from false [2023-11-29 04:58:38,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:58:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557787295] [2023-11-29 04:58:38,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557787295] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:58:38,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [720894375] [2023-11-29 04:58:38,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:58:38,676 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-29 04:58:38,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 [2023-11-29 04:58:38,677 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-29 04:58:38,678 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ca1400c0-bee0-49f1-a926-350e961c845a/bin/uautomizer-verify-BQ2R08f2Ya/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process