./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 14:12:29,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 14:12:29,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 14:12:29,870 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 14:12:29,870 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 14:12:29,871 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 14:12:29,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 14:12:29,873 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 14:12:29,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 14:12:29,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 14:12:29,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 14:12:29,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 14:12:29,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 14:12:29,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 14:12:29,878 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 14:12:29,879 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 14:12:29,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 14:12:29,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 14:12:29,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 14:12:29,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 14:12:29,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 14:12:29,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 14:12:29,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 14:12:29,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 14:12:29,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 14:12:29,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 14:12:29,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 14:12:29,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 14:12:29,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 14:12:29,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 14:12:29,889 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 14:12:29,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 14:12:29,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 14:12:29,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 14:12:29,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 14:12:29,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 14:12:29,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 14:12:29,893 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 14:12:29,893 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 14:12:29,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 14:12:29,894 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 14:12:29,895 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-19 14:12:29,909 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 14:12:29,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 14:12:29,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 14:12:29,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 14:12:29,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 14:12:29,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 14:12:29,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 14:12:29,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 14:12:29,912 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 14:12:29,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 14:12:29,912 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 14:12:29,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 14:12:29,913 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 14:12:29,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 14:12:29,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 14:12:29,913 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 14:12:29,913 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 14:12:29,914 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 14:12:29,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 14:12:29,914 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 14:12:29,914 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 14:12:29,914 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 14:12:29,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 14:12:29,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 14:12:29,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 14:12:29,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 14:12:29,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 14:12:29,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 14:12:29,915 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 14:12:29,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-19 14:12:29,916 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 14:12:29,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2021-12-19 14:12:30,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 14:12:30,144 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 14:12:30,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 14:12:30,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 14:12:30,150 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 14:12:30,151 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2021-12-19 14:12:30,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2105a6505/eb691a233f9b41ee8ee0093064719670/FLAG31053a30a [2021-12-19 14:12:30,668 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 14:12:30,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2021-12-19 14:12:30,685 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2105a6505/eb691a233f9b41ee8ee0093064719670/FLAG31053a30a [2021-12-19 14:12:30,695 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2105a6505/eb691a233f9b41ee8ee0093064719670 [2021-12-19 14:12:30,699 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 14:12:30,701 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 14:12:30,702 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:30,702 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 14:12:30,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 14:12:30,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:30" (1/1) ... [2021-12-19 14:12:30,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ede277a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:30, skipping insertion in model container [2021-12-19 14:12:30,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:30" (1/1) ... [2021-12-19 14:12:30,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 14:12:30,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 14:12:31,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2021-12-19 14:12:31,108 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2021-12-19 14:12:31,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2021-12-19 14:12:31,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2021-12-19 14:12:31,214 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:31,230 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2021-12-19 14:12:31,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ce71fc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:31, skipping insertion in model container [2021-12-19 14:12:31,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:31,231 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-19 14:12:31,232 INFO L158 Benchmark]: Toolchain (without parser) took 531.17ms. Allocated memory is still 102.8MB. Free memory was 68.3MB in the beginning and 66.4MB in the end (delta: 1.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 14:12:31,234 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 37.8MB in the beginning and 37.8MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-19 14:12:31,234 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.32ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 66.4MB in the end (delta: 1.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-19 14:12:31,237 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 37.8MB in the beginning and 37.8MB in the end (delta: 36.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.32ms. Allocated memory is still 102.8MB. Free memory was 68.0MB in the beginning and 66.4MB in the end (delta: 1.6MB). Peak memory consumption was 10.5MB. 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 where the value type is smaller than the cast-to type 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/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 14:12:32,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 14:12:33,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 14:12:33,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 14:12:33,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 14:12:33,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 14:12:33,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 14:12:33,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 14:12:33,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 14:12:33,047 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 14:12:33,048 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 14:12:33,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 14:12:33,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 14:12:33,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 14:12:33,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 14:12:33,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 14:12:33,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 14:12:33,058 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 14:12:33,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 14:12:33,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 14:12:33,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 14:12:33,066 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 14:12:33,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 14:12:33,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 14:12:33,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 14:12:33,075 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 14:12:33,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 14:12:33,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 14:12:33,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 14:12:33,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 14:12:33,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 14:12:33,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 14:12:33,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 14:12:33,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 14:12:33,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 14:12:33,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 14:12:33,086 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 14:12:33,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 14:12:33,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 14:12:33,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 14:12:33,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 14:12:33,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-19 14:12:33,116 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 14:12:33,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 14:12:33,117 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 14:12:33,117 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 14:12:33,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-19 14:12:33,118 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-19 14:12:33,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 14:12:33,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 14:12:33,120 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 14:12:33,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 14:12:33,121 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-19 14:12:33,121 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 14:12:33,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 14:12:33,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-19 14:12:33,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 14:12:33,121 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-19 14:12:33,122 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-19 14:12:33,123 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 14:12:33,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 14:12:33,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 14:12:33,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-19 14:12:33,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 14:12:33,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 14:12:33,124 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-19 14:12:33,124 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-19 14:12:33,124 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-19 14:12:33,124 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 14:12:33,124 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-19 14:12:33,125 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 7743788eb05cb3443d5449a0c3250a50955573eb924e62e5cc797e3ef82e3ba3 [2021-12-19 14:12:33,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 14:12:33,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 14:12:33,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 14:12:33,443 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 14:12:33,443 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 14:12:33,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2021-12-19 14:12:33,491 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f93cd3b/647b3a02bcaa4f438b10e4ab54b31be9/FLAG810a9b062 [2021-12-19 14:12:33,966 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 14:12:33,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i [2021-12-19 14:12:33,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f93cd3b/647b3a02bcaa4f438b10e4ab54b31be9/FLAG810a9b062 [2021-12-19 14:12:34,474 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31f93cd3b/647b3a02bcaa4f438b10e4ab54b31be9 [2021-12-19 14:12:34,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 14:12:34,478 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 14:12:34,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:34,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 14:12:34,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 14:12:34,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:34" (1/1) ... [2021-12-19 14:12:34,493 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177aaada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:34, skipping insertion in model container [2021-12-19 14:12:34,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:12:34" (1/1) ... [2021-12-19 14:12:34,499 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 14:12:34,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 14:12:34,897 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2021-12-19 14:12:34,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2021-12-19 14:12:35,020 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2021-12-19 14:12:35,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2021-12-19 14:12:35,035 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:35,047 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-19 14:12:35,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 14:12:35,076 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2021-12-19 14:12:35,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2021-12-19 14:12:35,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2021-12-19 14:12:35,124 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2021-12-19 14:12:35,126 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:35,129 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 14:12:35,145 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44118,44131] [2021-12-19 14:12:35,146 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[44660,44673] [2021-12-19 14:12:35,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56247,56260] [2021-12-19 14:12:35,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test6-1.i[56368,56381] [2021-12-19 14:12:35,182 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 14:12:35,231 INFO L208 MainTranslator]: Completed translation [2021-12-19 14:12:35,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35 WrapperNode [2021-12-19 14:12:35,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 14:12:35,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 14:12:35,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 14:12:35,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 14:12:35,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,350 INFO L137 Inliner]: procedures = 285, calls = 294, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1042 [2021-12-19 14:12:35,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 14:12:35,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 14:12:35,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 14:12:35,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 14:12:35,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 14:12:35,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 14:12:35,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 14:12:35,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 14:12:35,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (1/1) ... [2021-12-19 14:12:35,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-19 14:12:35,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 14:12:35,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-19 14:12:35,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-19 14:12:35,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-19 14:12:35,522 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2021-12-19 14:12:35,523 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2021-12-19 14:12:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-19 14:12:35,523 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-19 14:12:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-19 14:12:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-19 14:12:35,523 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2021-12-19 14:12:35,535 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2021-12-19 14:12:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-19 14:12:35,535 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2021-12-19 14:12:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2021-12-19 14:12:35,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 14:12:35,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 14:12:35,696 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 14:12:35,698 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 14:12:38,658 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 14:12:38,671 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 14:12:38,671 INFO L301 CfgBuilder]: Removed 63 assume(true) statements. [2021-12-19 14:12:38,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:12:38 BoogieIcfgContainer [2021-12-19 14:12:38,676 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 14:12:38,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-19 14:12:38,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-19 14:12:38,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-19 14:12:38,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:12:34" (1/3) ... [2021-12-19 14:12:38,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eee318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:12:38, skipping insertion in model container [2021-12-19 14:12:38,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:12:35" (2/3) ... [2021-12-19 14:12:38,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58eee318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:12:38, skipping insertion in model container [2021-12-19 14:12:38,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:12:38" (3/3) ... [2021-12-19 14:12:38,683 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test6-1.i [2021-12-19 14:12:38,688 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-19 14:12:38,688 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 531 error locations. [2021-12-19 14:12:38,730 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-19 14:12:38,738 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-19 14:12:38,738 INFO L340 AbstractCegarLoop]: Starting to check reachability of 531 error locations. [2021-12-19 14:12:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 534 states have (on average 2.2284644194756553) internal successors, (1190), 1065 states have internal predecessors, (1190), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2021-12-19 14:12:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 14:12:38,772 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:38,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 14:12:38,772 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:38,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:38,776 INFO L85 PathProgramCache]: Analyzing trace with hash 77521, now seen corresponding path program 1 times [2021-12-19 14:12:38,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:38,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [327517844] [2021-12-19 14:12:38,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:38,784 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:38,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:38,786 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:38,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-19 14:12:38,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:38,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 14:12:38,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:39,062 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:39,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:39,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:39,087 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:39,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [327517844] [2021-12-19 14:12:39,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [327517844] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:39,088 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:39,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 14:12:39,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169492256] [2021-12-19 14:12:39,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:39,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 14:12:39,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:39,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 14:12:39,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:39,142 INFO L87 Difference]: Start difference. First operand has 1083 states, 534 states have (on average 2.2284644194756553) internal successors, (1190), 1065 states have internal predecessors, (1190), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-19 14:12:40,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:40,655 INFO L93 Difference]: Finished difference Result 1162 states and 1229 transitions. [2021-12-19 14:12:40,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 14:12:40,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-19 14:12:40,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:40,676 INFO L225 Difference]: With dead ends: 1162 [2021-12-19 14:12:40,678 INFO L226 Difference]: Without dead ends: 1160 [2021-12-19 14:12:40,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:40,684 INFO L933 BasicCegarLoop]: 798 mSDtfsCounter, 714 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:40,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [717 Valid, 1044 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-19 14:12:40,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2021-12-19 14:12:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1103. [2021-12-19 14:12:40,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 568 states have (on average 2.084507042253521) internal successors, (1184), 1086 states have internal predecessors, (1184), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:12:40,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1210 transitions. [2021-12-19 14:12:40,761 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1210 transitions. Word has length 3 [2021-12-19 14:12:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:40,762 INFO L470 AbstractCegarLoop]: Abstraction has 1103 states and 1210 transitions. [2021-12-19 14:12:40,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-19 14:12:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1210 transitions. [2021-12-19 14:12:40,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-12-19 14:12:40,762 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:40,762 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-12-19 14:12:40,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:40,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:40,970 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:40,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash 77522, now seen corresponding path program 1 times [2021-12-19 14:12:40,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466339664] [2021-12-19 14:12:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:40,972 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:40,973 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:40,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-19 14:12:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:41,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 14:12:41,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:41,099 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:41,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:41,110 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:41,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466339664] [2021-12-19 14:12:41,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466339664] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:41,110 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:41,110 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 14:12:41,111 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942647593] [2021-12-19 14:12:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:41,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 14:12:41,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:41,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 14:12:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:41,112 INFO L87 Difference]: Start difference. First operand 1103 states and 1210 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-19 14:12:43,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:43,272 INFO L93 Difference]: Finished difference Result 1497 states and 1638 transitions. [2021-12-19 14:12:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 14:12:43,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2021-12-19 14:12:43,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:43,279 INFO L225 Difference]: With dead ends: 1497 [2021-12-19 14:12:43,279 INFO L226 Difference]: Without dead ends: 1497 [2021-12-19 14:12:43,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:43,280 INFO L933 BasicCegarLoop]: 943 mSDtfsCounter, 418 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:43,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 1538 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-19 14:12:43,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2021-12-19 14:12:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1307. [2021-12-19 14:12:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1307 states, 771 states have (on average 2.0700389105058368) internal successors, (1596), 1288 states have internal predecessors, (1596), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 14:12:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1626 transitions. [2021-12-19 14:12:43,333 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1626 transitions. Word has length 3 [2021-12-19 14:12:43,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:43,333 INFO L470 AbstractCegarLoop]: Abstraction has 1307 states and 1626 transitions. [2021-12-19 14:12:43,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2021-12-19 14:12:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1626 transitions. [2021-12-19 14:12:43,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-19 14:12:43,334 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:43,334 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:43,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-19 14:12:43,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:43,541 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1111693489, now seen corresponding path program 1 times [2021-12-19 14:12:43,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:43,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [335983895] [2021-12-19 14:12:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:43,543 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:43,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:43,544 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:43,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-19 14:12:43,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:43,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:12:43,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:43,675 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:43,694 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:43,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 14:12:43,744 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:43,760 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:12:43,760 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:12:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:43,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:43,783 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:43,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [335983895] [2021-12-19 14:12:43,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [335983895] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:43,784 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:43,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:12:43,784 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867208191] [2021-12-19 14:12:43,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:43,785 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:12:43,785 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:43,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:12:43,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:43,785 INFO L87 Difference]: Start difference. First operand 1307 states and 1626 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-19 14:12:46,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:46,936 INFO L93 Difference]: Finished difference Result 1997 states and 2371 transitions. [2021-12-19 14:12:46,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:12:46,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2021-12-19 14:12:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:46,943 INFO L225 Difference]: With dead ends: 1997 [2021-12-19 14:12:46,943 INFO L226 Difference]: Without dead ends: 1997 [2021-12-19 14:12:46,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:46,948 INFO L933 BasicCegarLoop]: 655 mSDtfsCounter, 719 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:46,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 1587 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1797 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-19 14:12:46,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1997 states. [2021-12-19 14:12:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1997 to 1452. [2021-12-19 14:12:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 916 states have (on average 2.0513100436681224) internal successors, (1879), 1433 states have internal predecessors, (1879), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 14:12:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1909 transitions. [2021-12-19 14:12:46,981 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1909 transitions. Word has length 8 [2021-12-19 14:12:46,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:46,982 INFO L470 AbstractCegarLoop]: Abstraction has 1452 states and 1909 transitions. [2021-12-19 14:12:46,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) [2021-12-19 14:12:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1909 transitions. [2021-12-19 14:12:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 14:12:46,983 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:46,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:47,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-19 14:12:47,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:47,191 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:47,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:47,193 INFO L85 PathProgramCache]: Analyzing trace with hash -102759776, now seen corresponding path program 1 times [2021-12-19 14:12:47,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:47,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899663249] [2021-12-19 14:12:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:47,194 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:47,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:47,210 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:47,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-19 14:12:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:47,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-19 14:12:47,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:47,354 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:47,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:47,371 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:47,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899663249] [2021-12-19 14:12:47,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899663249] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:47,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:47,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:12:47,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148791894] [2021-12-19 14:12:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:47,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:12:47,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:47,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:12:47,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:47,376 INFO L87 Difference]: Start difference. First operand 1452 states and 1909 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 14:12:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:49,678 INFO L93 Difference]: Finished difference Result 2430 states and 3107 transitions. [2021-12-19 14:12:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:12:49,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-19 14:12:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:49,690 INFO L225 Difference]: With dead ends: 2430 [2021-12-19 14:12:49,690 INFO L226 Difference]: Without dead ends: 2430 [2021-12-19 14:12:49,690 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:49,691 INFO L933 BasicCegarLoop]: 1014 mSDtfsCounter, 2141 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:49,691 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2147 Valid, 1973 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-19 14:12:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2021-12-19 14:12:49,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1407. [2021-12-19 14:12:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 916 states have (on average 1.9868995633187774) internal successors, (1820), 1388 states have internal predecessors, (1820), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 14:12:49,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 1850 transitions. [2021-12-19 14:12:49,718 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 1850 transitions. Word has length 9 [2021-12-19 14:12:49,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:49,718 INFO L470 AbstractCegarLoop]: Abstraction has 1407 states and 1850 transitions. [2021-12-19 14:12:49,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 14:12:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 1850 transitions. [2021-12-19 14:12:49,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-19 14:12:49,719 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:49,719 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:49,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:49,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:49,927 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -102759775, now seen corresponding path program 1 times [2021-12-19 14:12:49,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011342158] [2021-12-19 14:12:49,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:49,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:49,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:49,930 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:49,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-19 14:12:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:50,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:12:50,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:50,054 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:50,085 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:50,086 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:50,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011342158] [2021-12-19 14:12:50,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011342158] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:50,086 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:50,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:12:50,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500223017] [2021-12-19 14:12:50,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:50,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:12:50,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:50,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:12:50,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:50,088 INFO L87 Difference]: Start difference. First operand 1407 states and 1850 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 14:12:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:52,729 INFO L93 Difference]: Finished difference Result 2046 states and 2685 transitions. [2021-12-19 14:12:52,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:12:52,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2021-12-19 14:12:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:52,735 INFO L225 Difference]: With dead ends: 2046 [2021-12-19 14:12:52,735 INFO L226 Difference]: Without dead ends: 2046 [2021-12-19 14:12:52,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:52,736 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 1375 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 2096 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:52,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1378 Valid, 2096 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-19 14:12:52,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-12-19 14:12:52,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1397. [2021-12-19 14:12:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 916 states have (on average 1.960698689956332) internal successors, (1796), 1378 states have internal predecessors, (1796), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 14:12:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1826 transitions. [2021-12-19 14:12:52,758 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1826 transitions. Word has length 9 [2021-12-19 14:12:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:52,759 INFO L470 AbstractCegarLoop]: Abstraction has 1397 states and 1826 transitions. [2021-12-19 14:12:52,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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) [2021-12-19 14:12:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1826 transitions. [2021-12-19 14:12:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-19 14:12:52,760 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:52,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:52,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:52,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:52,968 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr516ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:52,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:52,968 INFO L85 PathProgramCache]: Analyzing trace with hash -856298529, now seen corresponding path program 1 times [2021-12-19 14:12:52,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:52,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764295362] [2021-12-19 14:12:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:52,969 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:52,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:52,970 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:52,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-19 14:12:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:53,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:12:53,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:53,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:53,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:53,154 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:53,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764295362] [2021-12-19 14:12:53,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764295362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:53,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:53,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:12:53,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351634101] [2021-12-19 14:12:53,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:53,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:12:53,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:12:53,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:53,156 INFO L87 Difference]: Start difference. First operand 1397 states and 1826 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-12-19 14:12:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:53,640 INFO L93 Difference]: Finished difference Result 1873 states and 2393 transitions. [2021-12-19 14:12:53,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:12:53,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2021-12-19 14:12:53,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:53,646 INFO L225 Difference]: With dead ends: 1873 [2021-12-19 14:12:53,646 INFO L226 Difference]: Without dead ends: 1873 [2021-12-19 14:12:53,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:53,647 INFO L933 BasicCegarLoop]: 1156 mSDtfsCounter, 546 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 3122 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:53,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [555 Valid, 3122 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-19 14:12:53,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2021-12-19 14:12:53,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1648. [2021-12-19 14:12:53,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1167 states have (on average 1.974293059125964) internal successors, (2304), 1629 states have internal predecessors, (2304), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2021-12-19 14:12:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2334 transitions. [2021-12-19 14:12:53,680 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2334 transitions. Word has length 11 [2021-12-19 14:12:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:53,680 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2334 transitions. [2021-12-19 14:12:53,680 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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) [2021-12-19 14:12:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2334 transitions. [2021-12-19 14:12:53,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-12-19 14:12:53,682 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:53,682 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:53,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2021-12-19 14:12:53,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:53,890 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:53,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2117571646, now seen corresponding path program 1 times [2021-12-19 14:12:53,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:53,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264770373] [2021-12-19 14:12:53,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:53,892 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:53,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:53,909 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:53,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-19 14:12:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:54,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:12:54,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:54,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 14:12:54,069 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 14:12:54,070 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-19 14:12:54,132 INFO L354 Elim1Store]: treesize reduction 166, result has 13.5 percent of original size [2021-12-19 14:12:54,133 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 30 treesize of output 36 [2021-12-19 14:12:54,169 INFO L354 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2021-12-19 14:12:54,169 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 67 treesize of output 23 [2021-12-19 14:12:54,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:54,195 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:54,195 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:54,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264770373] [2021-12-19 14:12:54,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264770373] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:54,196 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:54,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:12:54,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817952486] [2021-12-19 14:12:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:54,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:12:54,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:12:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:54,197 INFO L87 Difference]: Start difference. First operand 1648 states and 2334 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, (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) [2021-12-19 14:12:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:55,157 INFO L93 Difference]: Finished difference Result 1654 states and 2037 transitions. [2021-12-19 14:12:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:12:55,159 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, (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 14 [2021-12-19 14:12:55,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:55,163 INFO L225 Difference]: With dead ends: 1654 [2021-12-19 14:12:55,163 INFO L226 Difference]: Without dead ends: 1654 [2021-12-19 14:12:55,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:55,163 INFO L933 BasicCegarLoop]: 1040 mSDtfsCounter, 357 mSDsluCounter, 1937 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 2977 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:55,164 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 2977 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-19 14:12:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2021-12-19 14:12:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1290. [2021-12-19 14:12:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1290 states, 811 states have (on average 1.9506781750924784) internal successors, (1582), 1273 states have internal predecessors, (1582), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:12:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1608 transitions. [2021-12-19 14:12:55,182 INFO L78 Accepts]: Start accepts. Automaton has 1290 states and 1608 transitions. Word has length 14 [2021-12-19 14:12:55,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:55,182 INFO L470 AbstractCegarLoop]: Abstraction has 1290 states and 1608 transitions. [2021-12-19 14:12:55,182 INFO L471 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, (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) [2021-12-19 14:12:55,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1290 states and 1608 transitions. [2021-12-19 14:12:55,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-19 14:12:55,183 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:55,183 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:55,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:55,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:55,392 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 769788685, now seen corresponding path program 1 times [2021-12-19 14:12:55,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:55,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679339663] [2021-12-19 14:12:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:55,393 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:55,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:55,394 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:55,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-19 14:12:55,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:55,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 14:12:55,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:55,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:55,544 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:55,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679339663] [2021-12-19 14:12:55,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679339663] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:55,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:55,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-19 14:12:55,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420121293] [2021-12-19 14:12:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:55,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-19 14:12:55,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:55,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-19 14:12:55,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:55,545 INFO L87 Difference]: Start difference. First operand 1290 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 14:12:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:55,563 INFO L93 Difference]: Finished difference Result 1230 states and 1522 transitions. [2021-12-19 14:12:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-19 14:12:55,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-19 14:12:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:55,566 INFO L225 Difference]: With dead ends: 1230 [2021-12-19 14:12:55,566 INFO L226 Difference]: Without dead ends: 1230 [2021-12-19 14:12:55,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-19 14:12:55,567 INFO L933 BasicCegarLoop]: 1029 mSDtfsCounter, 959 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:55,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [971 Valid, 1096 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:12:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2021-12-19 14:12:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2021-12-19 14:12:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 775 states have (on average 1.9303225806451614) internal successors, (1496), 1213 states have internal predecessors, (1496), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:12:55,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1522 transitions. [2021-12-19 14:12:55,584 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1522 transitions. Word has length 19 [2021-12-19 14:12:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:55,584 INFO L470 AbstractCegarLoop]: Abstraction has 1230 states and 1522 transitions. [2021-12-19 14:12:55,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 14:12:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1522 transitions. [2021-12-19 14:12:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-12-19 14:12:55,585 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:55,585 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:12:55,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:55,793 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:55,794 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1032548102, now seen corresponding path program 1 times [2021-12-19 14:12:55,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:55,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239648899] [2021-12-19 14:12:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:55,795 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:55,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:55,796 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:55,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-19 14:12:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:55,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 14:12:55,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:56,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:56,009 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:56,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239648899] [2021-12-19 14:12:56,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239648899] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:56,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:56,010 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:12:56,010 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165364838] [2021-12-19 14:12:56,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:56,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:12:56,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:56,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:12:56,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:12:56,011 INFO L87 Difference]: Start difference. First operand 1230 states and 1522 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-19 14:12:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:56,066 INFO L93 Difference]: Finished difference Result 1202 states and 1466 transitions. [2021-12-19 14:12:56,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:12:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 21 [2021-12-19 14:12:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:56,070 INFO L225 Difference]: With dead ends: 1202 [2021-12-19 14:12:56,070 INFO L226 Difference]: Without dead ends: 1202 [2021-12-19 14:12:56,070 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:56,071 INFO L933 BasicCegarLoop]: 984 mSDtfsCounter, 930 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 2028 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:56,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [942 Valid, 2028 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:12:56,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2021-12-19 14:12:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 1200. [2021-12-19 14:12:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1200 states, 759 states have (on average 1.8945981554677207) internal successors, (1438), 1183 states have internal predecessors, (1438), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:12:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1200 states to 1200 states and 1464 transitions. [2021-12-19 14:12:56,086 INFO L78 Accepts]: Start accepts. Automaton has 1200 states and 1464 transitions. Word has length 21 [2021-12-19 14:12:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:56,087 INFO L470 AbstractCegarLoop]: Abstraction has 1200 states and 1464 transitions. [2021-12-19 14:12:56,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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) [2021-12-19 14:12:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1200 states and 1464 transitions. [2021-12-19 14:12:56,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 14:12:56,088 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:56,088 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:12:56,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:56,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:56,299 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:56,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:56,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308372, now seen corresponding path program 1 times [2021-12-19 14:12:56,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:56,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146934712] [2021-12-19 14:12:56,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:56,300 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:56,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:56,301 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:56,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-19 14:12:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:56,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:12:56,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:56,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:56,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:56,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:56,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146934712] [2021-12-19 14:12:56,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146934712] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:56,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:56,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:12:56,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43215323] [2021-12-19 14:12:56,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:56,532 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 14:12:56,532 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:56,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 14:12:56,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:56,533 INFO L87 Difference]: Start difference. First operand 1200 states and 1464 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 14:12:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:12:59,128 INFO L93 Difference]: Finished difference Result 2184 states and 2665 transitions. [2021-12-19 14:12:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 14:12:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-12-19 14:12:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:12:59,134 INFO L225 Difference]: With dead ends: 2184 [2021-12-19 14:12:59,134 INFO L226 Difference]: Without dead ends: 2184 [2021-12-19 14:12:59,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 14:12:59,135 INFO L933 BasicCegarLoop]: 841 mSDtfsCounter, 2037 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 2019 SdHoareTripleChecker+Invalid, 1860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2021-12-19 14:12:59,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2040 Valid, 2019 Invalid, 1860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2021-12-19 14:12:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2021-12-19 14:12:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1196. [2021-12-19 14:12:59,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 759 states have (on average 1.8840579710144927) internal successors, (1430), 1179 states have internal predecessors, (1430), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:12:59,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1456 transitions. [2021-12-19 14:12:59,151 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1456 transitions. Word has length 35 [2021-12-19 14:12:59,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:12:59,151 INFO L470 AbstractCegarLoop]: Abstraction has 1196 states and 1456 transitions. [2021-12-19 14:12:59,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 14:12:59,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1456 transitions. [2021-12-19 14:12:59,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-19 14:12:59,152 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:12:59,152 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:12:59,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-19 14:12:59,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:12:59,360 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:12:59,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:12:59,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1673308373, now seen corresponding path program 1 times [2021-12-19 14:12:59,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:12:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760740324] [2021-12-19 14:12:59,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:12:59,362 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:12:59,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:12:59,364 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:12:59,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-19 14:12:59,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:12:59,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 14:12:59,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:12:59,528 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:12:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:12:59,714 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:12:59,714 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:12:59,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760740324] [2021-12-19 14:12:59,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760740324] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:12:59,714 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:12:59,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:12:59,714 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976755517] [2021-12-19 14:12:59,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:12:59,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 14:12:59,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:12:59,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 14:12:59,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:12:59,715 INFO L87 Difference]: Start difference. First operand 1196 states and 1456 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 14:13:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:02,735 INFO L93 Difference]: Finished difference Result 1806 states and 2219 transitions. [2021-12-19 14:13:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 14:13:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 35 [2021-12-19 14:13:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:02,740 INFO L225 Difference]: With dead ends: 1806 [2021-12-19 14:13:02,740 INFO L226 Difference]: Without dead ends: 1806 [2021-12-19 14:13:02,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-12-19 14:13:02,741 INFO L933 BasicCegarLoop]: 1234 mSDtfsCounter, 1782 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 1614 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:02,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1782 Valid, 2595 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1614 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-19 14:13:02,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2021-12-19 14:13:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1192. [2021-12-19 14:13:02,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 759 states have (on average 1.8735177865612649) internal successors, (1422), 1175 states have internal predecessors, (1422), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:13:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 1448 transitions. [2021-12-19 14:13:02,760 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 1448 transitions. Word has length 35 [2021-12-19 14:13:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:02,760 INFO L470 AbstractCegarLoop]: Abstraction has 1192 states and 1448 transitions. [2021-12-19 14:13:02,760 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2021-12-19 14:13:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 1448 transitions. [2021-12-19 14:13:02,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-19 14:13:02,765 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:02,765 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:02,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:02,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:02,974 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2063927218, now seen corresponding path program 1 times [2021-12-19 14:13:02,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:02,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118499272] [2021-12-19 14:13:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:02,975 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:02,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:02,976 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:02,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-19 14:13:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:03,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 14:13:03,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:03,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:03,286 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:03,286 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:03,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118499272] [2021-12-19 14:13:03,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118499272] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:03,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:03,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:03,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814473621] [2021-12-19 14:13:03,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:03,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:03,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:03,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:03,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:03,288 INFO L87 Difference]: Start difference. First operand 1192 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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) [2021-12-19 14:13:03,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:03,327 INFO L93 Difference]: Finished difference Result 1180 states and 1428 transitions. [2021-12-19 14:13:03,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:03,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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 54 [2021-12-19 14:13:03,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:03,333 INFO L225 Difference]: With dead ends: 1180 [2021-12-19 14:13:03,333 INFO L226 Difference]: Without dead ends: 1180 [2021-12-19 14:13:03,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:13:03,334 INFO L933 BasicCegarLoop]: 978 mSDtfsCounter, 906 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:03,334 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [918 Valid, 2006 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:13:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2021-12-19 14:13:03,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2021-12-19 14:13:03,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 747 states have (on average 1.8768406961178046) internal successors, (1402), 1163 states have internal predecessors, (1402), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2021-12-19 14:13:03,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1428 transitions. [2021-12-19 14:13:03,348 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1428 transitions. Word has length 54 [2021-12-19 14:13:03,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:03,349 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1428 transitions. [2021-12-19 14:13:03,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (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) [2021-12-19 14:13:03,349 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1428 transitions. [2021-12-19 14:13:03,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 14:13:03,351 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:03,351 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:03,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:03,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:03,561 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:03,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:03,563 INFO L85 PathProgramCache]: Analyzing trace with hash -203140862, now seen corresponding path program 1 times [2021-12-19 14:13:03,564 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:03,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259405577] [2021-12-19 14:13:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:03,564 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:03,565 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:03,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-19 14:13:03,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:03,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 14:13:03,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:03,898 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:13:03,898 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 26 [2021-12-19 14:13:03,934 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 14:13:03,934 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 [2021-12-19 14:13:04,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:04,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:04,168 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:04,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259405577] [2021-12-19 14:13:04,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259405577] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:04,168 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:04,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-19 14:13:04,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529471346] [2021-12-19 14:13:04,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:04,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-19 14:13:04,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:04,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 14:13:04,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:04,170 INFO L87 Difference]: Start difference. First operand 1180 states and 1428 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2021-12-19 14:13:06,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:06,253 INFO L93 Difference]: Finished difference Result 2641 states and 3168 transitions. [2021-12-19 14:13:06,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 14:13:06,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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 62 [2021-12-19 14:13:06,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:06,260 INFO L225 Difference]: With dead ends: 2641 [2021-12-19 14:13:06,261 INFO L226 Difference]: Without dead ends: 2641 [2021-12-19 14:13:06,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-12-19 14:13:06,261 INFO L933 BasicCegarLoop]: 881 mSDtfsCounter, 1374 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1377 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:06,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1377 Valid, 1960 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-19 14:13:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2021-12-19 14:13:06,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1617. [2021-12-19 14:13:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1169 states have (on average 1.872540633019675) internal successors, (2189), 1588 states have internal predecessors, (2189), 25 states have call successors, (25), 8 states have call predecessors, (25), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2021-12-19 14:13:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2239 transitions. [2021-12-19 14:13:06,311 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2239 transitions. Word has length 62 [2021-12-19 14:13:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:06,311 INFO L470 AbstractCegarLoop]: Abstraction has 1617 states and 2239 transitions. [2021-12-19 14:13:06,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 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) [2021-12-19 14:13:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2239 transitions. [2021-12-19 14:13:06,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-12-19 14:13:06,313 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:06,313 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:06,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:06,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:06,524 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr1REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:06,525 INFO L85 PathProgramCache]: Analyzing trace with hash -203140861, now seen corresponding path program 1 times [2021-12-19 14:13:06,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:06,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049300763] [2021-12-19 14:13:06,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:06,526 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:06,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:06,541 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:06,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-19 14:13:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:06,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 14:13:06,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:06,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 14:13:06,946 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:06,995 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:13:06,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:07,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:07,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:07,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049300763] [2021-12-19 14:13:07,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049300763] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:07,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:07,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 14:13:07,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870785112] [2021-12-19 14:13:07,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:07,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:07,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:07,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:07,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:07,562 INFO L87 Difference]: Start difference. First operand 1617 states and 2239 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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) [2021-12-19 14:13:09,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:09,797 INFO L93 Difference]: Finished difference Result 1623 states and 2246 transitions. [2021-12-19 14:13:09,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:13:09,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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 62 [2021-12-19 14:13:09,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:09,801 INFO L225 Difference]: With dead ends: 1623 [2021-12-19 14:13:09,801 INFO L226 Difference]: Without dead ends: 1623 [2021-12-19 14:13:09,801 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-19 14:13:09,802 INFO L933 BasicCegarLoop]: 960 mSDtfsCounter, 111 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 2476 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:09,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 2476 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2021-12-19 14:13:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-12-19 14:13:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1622. [2021-12-19 14:13:09,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1173 states have (on average 1.8695652173913044) internal successors, (2193), 1592 states have internal predecessors, (2193), 26 states have call successors, (26), 9 states have call predecessors, (26), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2021-12-19 14:13:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2245 transitions. [2021-12-19 14:13:09,832 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2245 transitions. Word has length 62 [2021-12-19 14:13:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:09,832 INFO L470 AbstractCegarLoop]: Abstraction has 1622 states and 2245 transitions. [2021-12-19 14:13:09,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 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) [2021-12-19 14:13:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2245 transitions. [2021-12-19 14:13:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 14:13:09,833 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:09,833 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:09,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2021-12-19 14:13:10,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:10,043 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:10,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:10,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1864793253, now seen corresponding path program 1 times [2021-12-19 14:13:10,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:10,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460722015] [2021-12-19 14:13:10,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:10,045 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:10,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:10,047 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:10,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2021-12-19 14:13:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:10,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:13:10,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:10,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:10,403 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:10,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460722015] [2021-12-19 14:13:10,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460722015] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:10,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:10,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 14:13:10,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113143090] [2021-12-19 14:13:10,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:10,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:10,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:10,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:10,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:10,406 INFO L87 Difference]: Start difference. First operand 1622 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 14:13:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:10,554 INFO L93 Difference]: Finished difference Result 1648 states and 2272 transitions. [2021-12-19 14:13:10,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 14:13:10,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 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 68 [2021-12-19 14:13:10,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:10,558 INFO L225 Difference]: With dead ends: 1648 [2021-12-19 14:13:10,558 INFO L226 Difference]: Without dead ends: 1648 [2021-12-19 14:13:10,559 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 14:13:10,559 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 19 mSDsluCounter, 3893 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4868 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:10,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 4868 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 14:13:10,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2021-12-19 14:13:10,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1646. [2021-12-19 14:13:10,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1646 states, 1191 states have (on average 1.8606213266162888) internal successors, (2216), 1612 states have internal predecessors, (2216), 28 states have call successors, (28), 13 states have call predecessors, (28), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-19 14:13:10,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 2272 transitions. [2021-12-19 14:13:10,580 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 2272 transitions. Word has length 68 [2021-12-19 14:13:10,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:10,580 INFO L470 AbstractCegarLoop]: Abstraction has 1646 states and 2272 transitions. [2021-12-19 14:13:10,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 14:13:10,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 2272 transitions. [2021-12-19 14:13:10,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-19 14:13:10,581 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:10,581 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:10,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:10,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:10,792 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:10,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:10,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1913615011, now seen corresponding path program 1 times [2021-12-19 14:13:10,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:10,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321834224] [2021-12-19 14:13:10,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:10,793 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:10,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:10,794 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:10,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2021-12-19 14:13:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:11,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 14:13:11,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:11,202 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:11,203 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:11,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321834224] [2021-12-19 14:13:11,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321834224] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:11,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:11,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 14:13:11,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922765555] [2021-12-19 14:13:11,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:11,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:11,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:11,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:11,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:11,204 INFO L87 Difference]: Start difference. First operand 1646 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-19 14:13:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:11,331 INFO L93 Difference]: Finished difference Result 1658 states and 2286 transitions. [2021-12-19 14:13:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 14:13:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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 68 [2021-12-19 14:13:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:11,336 INFO L225 Difference]: With dead ends: 1658 [2021-12-19 14:13:11,336 INFO L226 Difference]: Without dead ends: 1658 [2021-12-19 14:13:11,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-12-19 14:13:11,337 INFO L933 BasicCegarLoop]: 975 mSDtfsCounter, 23 mSDsluCounter, 2824 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:11,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 3799 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 14:13:11,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-12-19 14:13:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1649. [2021-12-19 14:13:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1193 states have (on average 1.859178541492037) internal successors, (2218), 1614 states have internal predecessors, (2218), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 14:13:11,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2275 transitions. [2021-12-19 14:13:11,364 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2275 transitions. Word has length 68 [2021-12-19 14:13:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:11,364 INFO L470 AbstractCegarLoop]: Abstraction has 1649 states and 2275 transitions. [2021-12-19 14:13:11,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 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) [2021-12-19 14:13:11,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2275 transitions. [2021-12-19 14:13:11,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 14:13:11,365 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:11,365 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:11,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:11,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:11,576 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:11,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:11,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999061, now seen corresponding path program 1 times [2021-12-19 14:13:11,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:11,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618728362] [2021-12-19 14:13:11,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:11,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:11,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:11,578 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:11,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-19 14:13:11,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:11,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 14:13:11,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:11,966 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:12,178 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-19 14:13:12,178 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 20 [2021-12-19 14:13:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:12,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:12,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618728362] [2021-12-19 14:13:12,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618728362] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:12,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:12,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 14:13:12,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315752099] [2021-12-19 14:13:12,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:12,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-19 14:13:12,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 14:13:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:12,190 INFO L87 Difference]: Start difference. First operand 1649 states and 2275 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 14:13:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:15,069 INFO L93 Difference]: Finished difference Result 2771 states and 3753 transitions. [2021-12-19 14:13:15,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 14:13:15,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2021-12-19 14:13:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:15,074 INFO L225 Difference]: With dead ends: 2771 [2021-12-19 14:13:15,074 INFO L226 Difference]: Without dead ends: 2771 [2021-12-19 14:13:15,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 14:13:15,075 INFO L933 BasicCegarLoop]: 807 mSDtfsCounter, 1430 mSDsluCounter, 2180 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 2987 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 742 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:15,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1436 Valid, 2987 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2110 Invalid, 0 Unknown, 742 Unchecked, 2.8s Time] [2021-12-19 14:13:15,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2021-12-19 14:13:15,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 1648. [2021-12-19 14:13:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1193 states have (on average 1.8575020955574182) internal successors, (2216), 1613 states have internal predecessors, (2216), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 14:13:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2273 transitions. [2021-12-19 14:13:15,098 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2273 transitions. Word has length 73 [2021-12-19 14:13:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:15,099 INFO L470 AbstractCegarLoop]: Abstraction has 1648 states and 2273 transitions. [2021-12-19 14:13:15,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 14:13:15,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2273 transitions. [2021-12-19 14:13:15,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-19 14:13:15,099 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:15,100 INFO L514 BasicCegarLoop]: 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] [2021-12-19 14:13:15,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:15,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:15,312 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1847999062, now seen corresponding path program 1 times [2021-12-19 14:13:15,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196093942] [2021-12-19 14:13:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:15,313 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:15,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:15,314 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:15,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2021-12-19 14:13:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:15,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 14:13:15,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:15,709 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:15,714 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:16,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-19 14:13:16,184 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:16,194 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:13:16,194 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:13:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:16,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:16,210 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:16,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196093942] [2021-12-19 14:13:16,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196093942] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:16,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:16,210 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 14:13:16,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704387688] [2021-12-19 14:13:16,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:16,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-19 14:13:16,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:16,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 14:13:16,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-19 14:13:16,211 INFO L87 Difference]: Start difference. First operand 1648 states and 2273 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 14:13:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:20,037 INFO L93 Difference]: Finished difference Result 2842 states and 3878 transitions. [2021-12-19 14:13:20,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 14:13:20,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 73 [2021-12-19 14:13:20,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:20,044 INFO L225 Difference]: With dead ends: 2842 [2021-12-19 14:13:20,044 INFO L226 Difference]: Without dead ends: 2842 [2021-12-19 14:13:20,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-12-19 14:13:20,045 INFO L933 BasicCegarLoop]: 1061 mSDtfsCounter, 2203 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 3073 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2209 SdHoareTripleChecker+Valid, 3042 SdHoareTripleChecker+Invalid, 3985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 3073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 882 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:20,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2209 Valid, 3042 Invalid, 3985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 3073 Invalid, 0 Unknown, 882 Unchecked, 3.7s Time] [2021-12-19 14:13:20,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2842 states. [2021-12-19 14:13:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2842 to 1644. [2021-12-19 14:13:20,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1197 states have (on average 1.8412698412698412) internal successors, (2204), 1609 states have internal predecessors, (2204), 28 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 14:13:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2261 transitions. [2021-12-19 14:13:20,065 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2261 transitions. Word has length 73 [2021-12-19 14:13:20,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:20,065 INFO L470 AbstractCegarLoop]: Abstraction has 1644 states and 2261 transitions. [2021-12-19 14:13:20,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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) [2021-12-19 14:13:20,066 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2261 transitions. [2021-12-19 14:13:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-12-19 14:13:20,066 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:20,066 INFO L514 BasicCegarLoop]: 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, 1, 1, 1] [2021-12-19 14:13:20,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:20,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:20,277 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:20,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:20,278 INFO L85 PathProgramCache]: Analyzing trace with hash 816968073, now seen corresponding path program 1 times [2021-12-19 14:13:20,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:20,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983848889] [2021-12-19 14:13:20,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:20,278 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:20,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:20,286 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:20,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2021-12-19 14:13:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:20,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 14:13:20,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:20,611 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:20,623 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:20,642 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:20,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:20,661 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:20,661 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:20,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983848889] [2021-12-19 14:13:20,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983848889] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:20,662 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:20,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 14:13:20,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551596603] [2021-12-19 14:13:20,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:20,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-19 14:13:20,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:20,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 14:13:20,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-19 14:13:20,663 INFO L87 Difference]: Start difference. First operand 1644 states and 2261 transitions. Second operand has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-12-19 14:13:23,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:23,318 INFO L93 Difference]: Finished difference Result 1659 states and 2277 transitions. [2021-12-19 14:13:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 14:13:23,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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 80 [2021-12-19 14:13:23,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:23,320 INFO L225 Difference]: With dead ends: 1659 [2021-12-19 14:13:23,320 INFO L226 Difference]: Without dead ends: 1659 [2021-12-19 14:13:23,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-19 14:13:23,321 INFO L933 BasicCegarLoop]: 961 mSDtfsCounter, 23 mSDsluCounter, 3121 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4082 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:23,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 4082 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2021-12-19 14:13:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2021-12-19 14:13:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1658. [2021-12-19 14:13:23,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1209 states have (on average 1.836228287841191) internal successors, (2220), 1621 states have internal predecessors, (2220), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 14:13:23,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2277 transitions. [2021-12-19 14:13:23,347 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2277 transitions. Word has length 80 [2021-12-19 14:13:23,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:23,347 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 2277 transitions. [2021-12-19 14:13:23,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 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) [2021-12-19 14:13:23,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2277 transitions. [2021-12-19 14:13:23,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-12-19 14:13:23,348 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:23,348 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1] [2021-12-19 14:13:23,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:23,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:23,559 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:23,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:23,560 INFO L85 PathProgramCache]: Analyzing trace with hash -443793445, now seen corresponding path program 1 times [2021-12-19 14:13:23,560 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:23,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596611471] [2021-12-19 14:13:23,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:23,561 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:23,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:23,562 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:23,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2021-12-19 14:13:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:23,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-19 14:13:23,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:23,916 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:23,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:23,954 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:23,993 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-19 14:13:23,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:24,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:24,060 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:24,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596611471] [2021-12-19 14:13:24,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596611471] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:24,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:24,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-19 14:13:24,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444714494] [2021-12-19 14:13:24,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:24,061 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-19 14:13:24,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:24,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-19 14:13:24,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-19 14:13:24,061 INFO L87 Difference]: Start difference. First operand 1658 states and 2277 transitions. Second operand has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2021-12-19 14:13:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:28,070 INFO L93 Difference]: Finished difference Result 1658 states and 2275 transitions. [2021-12-19 14:13:28,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 14:13:28,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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 81 [2021-12-19 14:13:28,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:28,075 INFO L225 Difference]: With dead ends: 1658 [2021-12-19 14:13:28,075 INFO L226 Difference]: Without dead ends: 1658 [2021-12-19 14:13:28,075 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2021-12-19 14:13:28,076 INFO L933 BasicCegarLoop]: 956 mSDtfsCounter, 19 mSDsluCounter, 3932 mSDsCounter, 0 mSdLazyCounter, 2858 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 4888 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:28,076 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 4888 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2858 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2021-12-19 14:13:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-12-19 14:13:28,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2021-12-19 14:13:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1658 states, 1209 states have (on average 1.8345740281224152) internal successors, (2218), 1621 states have internal predecessors, (2218), 28 states have call successors, (28), 15 states have call predecessors, (28), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2021-12-19 14:13:28,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2275 transitions. [2021-12-19 14:13:28,107 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2275 transitions. Word has length 81 [2021-12-19 14:13:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:28,107 INFO L470 AbstractCegarLoop]: Abstraction has 1658 states and 2275 transitions. [2021-12-19 14:13:28,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 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) [2021-12-19 14:13:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2275 transitions. [2021-12-19 14:13:28,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-12-19 14:13:28,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:28,108 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:28,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:28,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:28,319 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 540063607, now seen corresponding path program 1 times [2021-12-19 14:13:28,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:28,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025634753] [2021-12-19 14:13:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:28,321 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:28,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:28,322 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:28,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2021-12-19 14:13:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:28,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 14:13:28,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:28,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 14:13:28,681 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:28,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025634753] [2021-12-19 14:13:28,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025634753] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 14:13:28,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 14:13:28,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-19 14:13:28,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711078673] [2021-12-19 14:13:28,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 14:13:28,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-19 14:13:28,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:28,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-19 14:13:28,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-19 14:13:28,692 INFO L87 Difference]: Start difference. First operand 1658 states and 2275 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2021-12-19 14:13:28,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:28,744 INFO L93 Difference]: Finished difference Result 1674 states and 2293 transitions. [2021-12-19 14:13:28,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-19 14:13:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 88 [2021-12-19 14:13:28,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:28,747 INFO L225 Difference]: With dead ends: 1674 [2021-12-19 14:13:28,747 INFO L226 Difference]: Without dead ends: 1668 [2021-12-19 14:13:28,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-19 14:13:28,748 INFO L933 BasicCegarLoop]: 964 mSDtfsCounter, 10 mSDsluCounter, 2876 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:28,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 3840 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-19 14:13:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2021-12-19 14:13:28,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2021-12-19 14:13:28,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1217 states have (on average 1.8307313064913722) internal successors, (2228), 1631 states have internal predecessors, (2228), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:13:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 2287 transitions. [2021-12-19 14:13:28,762 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 2287 transitions. Word has length 88 [2021-12-19 14:13:28,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:28,763 INFO L470 AbstractCegarLoop]: Abstraction has 1668 states and 2287 transitions. [2021-12-19 14:13:28,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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) [2021-12-19 14:13:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 2287 transitions. [2021-12-19 14:13:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-19 14:13:28,763 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:28,764 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:28,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:28,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:28,975 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1380796229, now seen corresponding path program 1 times [2021-12-19 14:13:28,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187293661] [2021-12-19 14:13:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:13:28,976 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:28,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:28,977 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:28,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2021-12-19 14:13:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:13:29,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 14:13:29,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:29,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:29,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:13:29,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:29,580 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:29,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187293661] [2021-12-19 14:13:29,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187293661] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:13:29,580 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:13:29,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-12-19 14:13:29,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079398952] [2021-12-19 14:13:29,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:13:29,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-19 14:13:29,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 14:13:29,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2021-12-19 14:13:29,582 INFO L87 Difference]: Start difference. First operand 1668 states and 2287 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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) [2021-12-19 14:13:29,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:29,759 INFO L93 Difference]: Finished difference Result 1694 states and 2317 transitions. [2021-12-19 14:13:29,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-19 14:13:29,761 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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 89 [2021-12-19 14:13:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:29,764 INFO L225 Difference]: With dead ends: 1694 [2021-12-19 14:13:29,764 INFO L226 Difference]: Without dead ends: 1682 [2021-12-19 14:13:29,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2021-12-19 14:13:29,764 INFO L933 BasicCegarLoop]: 967 mSDtfsCounter, 42 mSDsluCounter, 5759 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 6726 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:29,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 6726 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-19 14:13:29,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2021-12-19 14:13:29,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1676. [2021-12-19 14:13:29,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1676 states, 1225 states have (on average 1.826938775510204) internal successors, (2238), 1639 states have internal predecessors, (2238), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:13:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2297 transitions. [2021-12-19 14:13:29,778 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2297 transitions. Word has length 89 [2021-12-19 14:13:29,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:29,778 INFO L470 AbstractCegarLoop]: Abstraction has 1676 states and 2297 transitions. [2021-12-19 14:13:29,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 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) [2021-12-19 14:13:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2297 transitions. [2021-12-19 14:13:29,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-12-19 14:13:29,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:29,779 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:29,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2021-12-19 14:13:29,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:29,986 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:29,986 INFO L85 PathProgramCache]: Analyzing trace with hash 180173559, now seen corresponding path program 2 times [2021-12-19 14:13:29,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:29,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1667350411] [2021-12-19 14:13:29,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 14:13:29,987 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:29,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:29,989 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:29,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2021-12-19 14:13:30,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 14:13:30,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:13:30,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 14:13:30,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:30,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:30,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:13:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:30,941 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:30,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1667350411] [2021-12-19 14:13:30,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1667350411] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:13:30,941 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:13:30,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-19 14:13:30,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080777311] [2021-12-19 14:13:30,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:13:30,943 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 14:13:30,943 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:30,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 14:13:30,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-12-19 14:13:30,943 INFO L87 Difference]: Start difference. First operand 1676 states and 2297 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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) [2021-12-19 14:13:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:31,477 INFO L93 Difference]: Finished difference Result 1730 states and 2365 transitions. [2021-12-19 14:13:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-12-19 14:13:31,478 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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 92 [2021-12-19 14:13:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:31,480 INFO L225 Difference]: With dead ends: 1730 [2021-12-19 14:13:31,480 INFO L226 Difference]: Without dead ends: 1718 [2021-12-19 14:13:31,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2021-12-19 14:13:31,481 INFO L933 BasicCegarLoop]: 973 mSDtfsCounter, 89 mSDsluCounter, 6763 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 7736 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:31,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 7736 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-19 14:13:31,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2021-12-19 14:13:31,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1694. [2021-12-19 14:13:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1694 states, 1243 states have (on average 1.819790828640386) internal successors, (2262), 1657 states have internal predecessors, (2262), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:13:31,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1694 states to 1694 states and 2321 transitions. [2021-12-19 14:13:31,497 INFO L78 Accepts]: Start accepts. Automaton has 1694 states and 2321 transitions. Word has length 92 [2021-12-19 14:13:31,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:31,497 INFO L470 AbstractCegarLoop]: Abstraction has 1694 states and 2321 transitions. [2021-12-19 14:13:31,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 16 states have internal predecessors, (96), 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) [2021-12-19 14:13:31,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1694 states and 2321 transitions. [2021-12-19 14:13:31,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2021-12-19 14:13:31,498 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:31,498 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:31,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:31,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:31,710 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash -231196617, now seen corresponding path program 3 times [2021-12-19 14:13:31,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:31,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1380709643] [2021-12-19 14:13:31,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 14:13:31,711 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:31,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:31,724 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:31,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2021-12-19 14:13:32,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 14:13:32,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:13:32,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 14:13:32,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:33,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:13:33,684 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:33,684 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:33,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1380709643] [2021-12-19 14:13:33,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1380709643] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:13:33,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:13:33,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-19 14:13:33,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759846211] [2021-12-19 14:13:33,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:13:33,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-19 14:13:33,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:33,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-19 14:13:33,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2021-12-19 14:13:33,699 INFO L87 Difference]: Start difference. First operand 1694 states and 2321 transitions. Second operand has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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) [2021-12-19 14:13:36,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:36,511 INFO L93 Difference]: Finished difference Result 1802 states and 2469 transitions. [2021-12-19 14:13:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-12-19 14:13:36,512 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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 [2021-12-19 14:13:36,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:36,514 INFO L225 Difference]: With dead ends: 1802 [2021-12-19 14:13:36,515 INFO L226 Difference]: Without dead ends: 1784 [2021-12-19 14:13:36,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=924, Invalid=1832, Unknown=0, NotChecked=0, Total=2756 [2021-12-19 14:13:36,516 INFO L933 BasicCegarLoop]: 985 mSDtfsCounter, 212 mSDsluCounter, 12711 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 13696 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:36,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 13696 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2021-12-19 14:13:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2021-12-19 14:13:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1730. [2021-12-19 14:13:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1279 states have (on average 1.8045347928068804) internal successors, (2308), 1693 states have internal predecessors, (2308), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:13:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2367 transitions. [2021-12-19 14:13:36,535 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2367 transitions. Word has length 98 [2021-12-19 14:13:36,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:36,535 INFO L470 AbstractCegarLoop]: Abstraction has 1730 states and 2367 transitions. [2021-12-19 14:13:36,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.857142857142857) internal successors, (108), 28 states have internal predecessors, (108), 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) [2021-12-19 14:13:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2367 transitions. [2021-12-19 14:13:36,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-12-19 14:13:36,536 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:36,536 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:36,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:36,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:36,751 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:36,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 922313399, now seen corresponding path program 4 times [2021-12-19 14:13:36,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:36,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405404498] [2021-12-19 14:13:36,752 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 14:13:36,752 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:36,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:36,754 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:36,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2021-12-19 14:13:37,147 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 14:13:37,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:13:37,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-19 14:13:37,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:37,721 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:37,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:13:39,543 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 14:13:39,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:39,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405404498] [2021-12-19 14:13:39,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405404498] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 14:13:39,543 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:13:39,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2021-12-19 14:13:39,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538368157] [2021-12-19 14:13:39,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:13:39,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-19 14:13:39,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:13:39,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-19 14:13:39,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2021-12-19 14:13:39,545 INFO L87 Difference]: Start difference. First operand 1730 states and 2367 transitions. Second operand has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 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) [2021-12-19 14:13:49,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:13:49,212 INFO L93 Difference]: Finished difference Result 1936 states and 2637 transitions. [2021-12-19 14:13:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-19 14:13:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 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 110 [2021-12-19 14:13:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:13:49,216 INFO L225 Difference]: With dead ends: 1936 [2021-12-19 14:13:49,216 INFO L226 Difference]: Without dead ends: 1924 [2021-12-19 14:13:49,219 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=4121, Invalid=9921, Unknown=0, NotChecked=0, Total=14042 [2021-12-19 14:13:49,219 INFO L933 BasicCegarLoop]: 1007 mSDtfsCounter, 428 mSDsluCounter, 24990 mSDsCounter, 0 mSdLazyCounter, 2484 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 25997 SdHoareTripleChecker+Invalid, 2933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 2484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2021-12-19 14:13:49,219 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 25997 Invalid, 2933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 2484 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2021-12-19 14:13:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1924 states. [2021-12-19 14:13:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1924 to 1798. [2021-12-19 14:13:49,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1347 states have (on average 1.78173719376392) internal successors, (2400), 1761 states have internal predecessors, (2400), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:13:49,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2459 transitions. [2021-12-19 14:13:49,242 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2459 transitions. Word has length 110 [2021-12-19 14:13:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:13:49,242 INFO L470 AbstractCegarLoop]: Abstraction has 1798 states and 2459 transitions. [2021-12-19 14:13:49,242 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5384615384615383) internal successors, (132), 52 states have internal predecessors, (132), 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) [2021-12-19 14:13:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2459 transitions. [2021-12-19 14:13:49,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 14:13:49,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:13:49,245 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-19 14:13:49,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2021-12-19 14:13:49,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:13:49,458 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:13:49,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:13:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash 897981943, now seen corresponding path program 5 times [2021-12-19 14:13:49,459 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:13:49,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [875788045] [2021-12-19 14:13:49,460 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 14:13:49,460 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:13:49,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:13:49,461 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:13:49,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2021-12-19 14:13:50,872 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 14:13:50,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:13:50,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 65 conjunts are in the unsatisfiable core [2021-12-19 14:13:50,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:13:50,930 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:51,109 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:13:51,109 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:13:51,134 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:13:51,215 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:13:53,471 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:13:53,472 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:13:53,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:13:53,551 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:13:53,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:13:53,816 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2663 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_2663) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:13:53,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:13:53,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [875788045] [2021-12-19 14:13:53,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [875788045] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:13:53,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [465891295] [2021-12-19 14:13:53,818 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 14:13:53,818 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:13:53,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:13:53,832 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:13:53,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2021-12-19 14:15:30,550 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2021-12-19 14:15:30,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 14:15:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 14:15:30,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:15:30,806 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:30,956 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:15:30,956 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:15:30,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:15:31,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:32,949 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:15:32,950 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:15:32,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:15:32,996 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:15:32,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:15:33,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3142 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3142) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:15:33,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [465891295] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:15:33,193 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:15:33,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2021-12-19 14:15:33,193 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921889923] [2021-12-19 14:15:33,193 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:15:33,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-19 14:15:33,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:15:33,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 14:15:33,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=191, Unknown=15, NotChecked=58, Total=306 [2021-12-19 14:15:33,194 INFO L87 Difference]: Start difference. First operand 1798 states and 2459 transitions. Second operand has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:15:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:15:37,583 INFO L93 Difference]: Finished difference Result 2915 states and 3931 transitions. [2021-12-19 14:15:37,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-19 14:15:37,583 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 132 [2021-12-19 14:15:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:15:37,587 INFO L225 Difference]: With dead ends: 2915 [2021-12-19 14:15:37,587 INFO L226 Difference]: Without dead ends: 2915 [2021-12-19 14:15:37,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 165 SyntacticMatches, 90 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=69, Invalid=338, Unknown=21, NotChecked=78, Total=506 [2021-12-19 14:15:37,587 INFO L933 BasicCegarLoop]: 806 mSDtfsCounter, 1422 mSDsluCounter, 6022 mSDsCounter, 0 mSdLazyCounter, 4030 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1427 SdHoareTripleChecker+Valid, 6828 SdHoareTripleChecker+Invalid, 8407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4355 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:15:37,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1427 Valid, 6828 Invalid, 8407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4030 Invalid, 0 Unknown, 4355 Unchecked, 4.2s Time] [2021-12-19 14:15:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2915 states. [2021-12-19 14:15:37,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2915 to 1797. [2021-12-19 14:15:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1797 states, 1347 states have (on average 1.7802524127691166) internal successors, (2398), 1760 states have internal predecessors, (2398), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:15:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1797 states to 1797 states and 2457 transitions. [2021-12-19 14:15:37,604 INFO L78 Accepts]: Start accepts. Automaton has 1797 states and 2457 transitions. Word has length 132 [2021-12-19 14:15:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:15:37,604 INFO L470 AbstractCegarLoop]: Abstraction has 1797 states and 2457 transitions. [2021-12-19 14:15:37,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:15:37,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1797 states and 2457 transitions. [2021-12-19 14:15:37,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2021-12-19 14:15:37,605 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:15:37,605 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1] [2021-12-19 14:15:37,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2021-12-19 14:15:37,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2021-12-19 14:15:38,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:15:38,020 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:15:38,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:15:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 897981944, now seen corresponding path program 1 times [2021-12-19 14:15:38,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:15:38,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032939552] [2021-12-19 14:15:38,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:15:38,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:15:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:15:38,023 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:15:38,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2021-12-19 14:15:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:15:38,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 120 conjunts are in the unsatisfiable core [2021-12-19 14:15:38,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:15:38,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:39,162 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:39,194 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:15:39,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:15:39,219 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:39,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:15:39,314 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:39,317 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:40,696 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:15:40,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:15:40,700 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:15:40,731 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:15:40,734 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-19 14:15:40,753 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:15:40,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:15:41,378 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3712 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3712) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_3713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_3713) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-19 14:15:41,382 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:15:41,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032939552] [2021-12-19 14:15:41,383 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032939552] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:15:41,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128357308] [2021-12-19 14:15:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:15:41,383 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:15:41,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:15:41,384 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:15:41,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2021-12-19 14:18:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:18:29,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 118 conjunts are in the unsatisfiable core [2021-12-19 14:18:29,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:18:29,117 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:29,261 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:29,303 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:18:29,304 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:18:29,358 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:29,363 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:18:29,482 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:29,485 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:30,815 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:30,816 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:18:30,819 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:18:30,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:30,877 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-19 14:18:30,881 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:18:30,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:18:31,461 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4284) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_4283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4283) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv16 32)) (bvadd .cse1 (_ bv20 32)))))) is different from false [2021-12-19 14:18:31,465 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1128357308] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:18:31,465 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:18:31,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 19 [2021-12-19 14:18:31,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201465362] [2021-12-19 14:18:31,466 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:18:31,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-19 14:18:31,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:18:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 14:18:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=391, Unknown=18, NotChecked=82, Total=552 [2021-12-19 14:18:31,466 INFO L87 Difference]: Start difference. First operand 1797 states and 2457 transitions. Second operand has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 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) [2021-12-19 14:18:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:18:38,812 INFO L93 Difference]: Finished difference Result 2916 states and 3931 transitions. [2021-12-19 14:18:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-19 14:18:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 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 132 [2021-12-19 14:18:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:18:38,817 INFO L225 Difference]: With dead ends: 2916 [2021-12-19 14:18:38,817 INFO L226 Difference]: Without dead ends: 2916 [2021-12-19 14:18:38,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 160 SyntacticMatches, 89 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=120, Invalid=731, Unknown=27, NotChecked=114, Total=992 [2021-12-19 14:18:38,817 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 2570 mSDsluCounter, 5809 mSDsCounter, 0 mSdLazyCounter, 7194 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 6614 SdHoareTripleChecker+Invalid, 10072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 7194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2840 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:18:38,817 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2575 Valid, 6614 Invalid, 10072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 7194 Invalid, 0 Unknown, 2840 Unchecked, 7.0s Time] [2021-12-19 14:18:38,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2021-12-19 14:18:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 1796. [2021-12-19 14:18:38,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1796 states, 1347 states have (on average 1.7787676317743133) internal successors, (2396), 1759 states have internal predecessors, (2396), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:18:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1796 states to 1796 states and 2455 transitions. [2021-12-19 14:18:38,851 INFO L78 Accepts]: Start accepts. Automaton has 1796 states and 2455 transitions. Word has length 132 [2021-12-19 14:18:38,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:18:38,851 INFO L470 AbstractCegarLoop]: Abstraction has 1796 states and 2455 transitions. [2021-12-19 14:18:38,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.647058823529411) internal successors, (147), 16 states have internal predecessors, (147), 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) [2021-12-19 14:18:38,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1796 states and 2455 transitions. [2021-12-19 14:18:38,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 14:18:38,852 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:18:38,852 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:18:38,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2021-12-19 14:18:39,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2021-12-19 14:18:39,271 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:18:39,271 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:18:39,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:18:39,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895146, now seen corresponding path program 1 times [2021-12-19 14:18:39,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:18:39,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356882357] [2021-12-19 14:18:39,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:18:39,272 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:18:39,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:18:39,274 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:18:39,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2021-12-19 14:18:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:18:40,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 66 conjunts are in the unsatisfiable core [2021-12-19 14:18:40,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:18:40,234 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:40,392 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:18:40,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:18:40,413 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:18:40,514 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:42,361 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:42,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:18:42,439 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:42,440 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:18:42,456 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:18:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:18:42,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:18:42,533 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:18:42,540 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_4724) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:18:42,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4724 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_4770 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_4770))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_4724)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:18:42,709 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:18:42,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356882357] [2021-12-19 14:18:42,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356882357] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:18:42,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [199401344] [2021-12-19 14:18:42,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:18:42,710 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:18:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:18:42,720 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:18:42,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2021-12-19 14:18:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:18:47,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 14:18:47,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:18:47,211 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:47,350 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:18:47,350 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:18:47,362 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:18:47,405 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:49,011 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_48)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| v_arrayElimCell_48)))) (exists ((v_ArrVal_5209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5209)))) is different from true [2021-12-19 14:18:49,077 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:49,077 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:18:49,114 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:49,115 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:18:49,128 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:18:49,132 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 14:18:49,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:18:49,180 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_5210) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:18:49,366 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5256 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5210 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5256))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5210)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:18:49,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [199401344] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:18:49,368 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:18:49,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2021-12-19 14:18:49,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820679288] [2021-12-19 14:18:49,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:18:49,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 14:18:49,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:18:49,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 14:18:49,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=250, Unknown=22, NotChecked=222, Total=552 [2021-12-19 14:18:49,370 INFO L87 Difference]: Start difference. First operand 1796 states and 2455 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 14:18:49,734 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4723 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_4723))) (exists ((v_arrayElimCell_48 (_ BitVec 32)) (|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| (_ BitVec 32))) (and (= (_ bv0 1) (bvadd (bvneg (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12|))) (_ bv1 1))) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_48)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_12| v_arrayElimCell_48)))) (exists ((v_ArrVal_5209 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5209)))) is different from true [2021-12-19 14:18:54,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:18:54,417 INFO L93 Difference]: Finished difference Result 2913 states and 3927 transitions. [2021-12-19 14:18:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-19 14:18:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 135 [2021-12-19 14:18:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:18:54,433 INFO L225 Difference]: With dead ends: 2913 [2021-12-19 14:18:54,434 INFO L226 Difference]: Without dead ends: 2913 [2021-12-19 14:18:54,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 172 SyntacticMatches, 90 SemanticMatches, 28 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=87, Invalid=418, Unknown=29, NotChecked=336, Total=870 [2021-12-19 14:18:54,434 INFO L933 BasicCegarLoop]: 805 mSDtfsCounter, 1420 mSDsluCounter, 7216 mSDsCounter, 0 mSdLazyCounter, 4678 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 8021 SdHoareTripleChecker+Invalid, 9091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4389 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2021-12-19 14:18:54,435 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1425 Valid, 8021 Invalid, 9091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4678 Invalid, 0 Unknown, 4389 Unchecked, 4.8s Time] [2021-12-19 14:18:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2021-12-19 14:18:54,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 1795. [2021-12-19 14:18:54,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1795 states, 1347 states have (on average 1.77728285077951) internal successors, (2394), 1758 states have internal predecessors, (2394), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:18:54,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2453 transitions. [2021-12-19 14:18:54,463 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2453 transitions. Word has length 135 [2021-12-19 14:18:54,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:18:54,464 INFO L470 AbstractCegarLoop]: Abstraction has 1795 states and 2453 transitions. [2021-12-19 14:18:54,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 14 states have internal predecessors, (92), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 14:18:54,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2453 transitions. [2021-12-19 14:18:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-12-19 14:18:54,465 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:18:54,465 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:18:54,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2021-12-19 14:18:54,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2021-12-19 14:18:54,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 14:18:54,893 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:18:54,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:18:54,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1570895145, now seen corresponding path program 1 times [2021-12-19 14:18:54,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:18:54,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172493052] [2021-12-19 14:18:54,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:18:54,894 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:18:54,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:18:54,895 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:18:54,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2021-12-19 14:18:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:18:55,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 123 conjunts are in the unsatisfiable core [2021-12-19 14:18:55,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:18:55,875 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:56,160 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:56,194 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:18:56,195 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:18:56,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:56,224 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:18:56,319 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:56,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:57,699 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:57,699 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:18:57,703 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:18:57,789 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:18:57,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:18:57,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:18:57,814 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:18:57,817 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-19 14:18:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:18:57,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:18:57,990 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:18:58,016 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:18:58,585 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5743 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) .cse0 v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_5743) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_5834 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5835 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_5742 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5835) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_5834) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_5742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 14:18:58,590 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:18:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172493052] [2021-12-19 14:18:58,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [172493052] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:18:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2003025440] [2021-12-19 14:18:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:18:58,591 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:18:58,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:18:58,592 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:18:58,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2021-12-19 14:19:02,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:02,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 910 conjuncts, 121 conjunts are in the unsatisfiable core [2021-12-19 14:19:02,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:02,334 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:02,498 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:02,519 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:19:02,520 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:19:02,560 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:02,564 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:19:02,671 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:02,673 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:03,948 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 14:19:03,985 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:03,985 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:19:03,988 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:19:04,083 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:04,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:19:04,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:19:04,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-19 14:19:04,106 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 14:19:04,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:04,148 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:19:04,166 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:19:04,668 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6322 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) .cse0 v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_6322) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_6413 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6414 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6321 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6414) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6413) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_6321) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv4 32)) (bvadd .cse3 (_ bv8 32)))))) is different from false [2021-12-19 14:19:04,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2003025440] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:04,673 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:19:04,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 22 [2021-12-19 14:19:04,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29429183] [2021-12-19 14:19:04,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:19:04,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-19 14:19:04,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:19:04,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-19 14:19:04,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=473, Unknown=26, NotChecked=350, Total=930 [2021-12-19 14:19:04,674 INFO L87 Difference]: Start difference. First operand 1795 states and 2453 transitions. Second operand has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:19:05,213 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5741 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5741))) (exists ((v_ArrVal_5740 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_5740))) (exists ((v_ArrVal_6319 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6319))) (exists ((v_arrayElimCell_60 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_60) (_ bv44 32))) (exists ((v_ArrVal_6320 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_6320)))) is different from true [2021-12-19 14:19:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:19:13,982 INFO L93 Difference]: Finished difference Result 2914 states and 3927 transitions. [2021-12-19 14:19:13,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-19 14:19:13,982 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 135 [2021-12-19 14:19:13,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:19:13,985 INFO L225 Difference]: With dead ends: 2914 [2021-12-19 14:19:13,985 INFO L226 Difference]: Without dead ends: 2914 [2021-12-19 14:19:13,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 166 SyntacticMatches, 89 SemanticMatches, 39 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=152, Invalid=900, Unknown=36, NotChecked=552, Total=1640 [2021-12-19 14:19:13,987 INFO L933 BasicCegarLoop]: 804 mSDtfsCounter, 1979 mSDsluCounter, 7170 mSDsCounter, 0 mSdLazyCounter, 8916 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1984 SdHoareTripleChecker+Valid, 7974 SdHoareTripleChecker+Invalid, 13456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 8916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4502 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2021-12-19 14:19:13,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1984 Valid, 7974 Invalid, 13456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 8916 Invalid, 0 Unknown, 4502 Unchecked, 9.0s Time] [2021-12-19 14:19:13,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2021-12-19 14:19:13,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 1794. [2021-12-19 14:19:14,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1347 states have (on average 1.7757980697847067) internal successors, (2392), 1757 states have internal predecessors, (2392), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:19:14,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2451 transitions. [2021-12-19 14:19:14,002 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2451 transitions. Word has length 135 [2021-12-19 14:19:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:19:14,002 INFO L470 AbstractCegarLoop]: Abstraction has 1794 states and 2451 transitions. [2021-12-19 14:19:14,002 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.85) internal successors, (157), 19 states have internal predecessors, (157), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:19:14,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2451 transitions. [2021-12-19 14:19:14,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 14:19:14,003 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:19:14,003 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:19:14,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Ended with exit code 0 [2021-12-19 14:19:14,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2021-12-19 14:19:14,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:19:14,419 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:19:14,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:19:14,419 INFO L85 PathProgramCache]: Analyzing trace with hash -573302594, now seen corresponding path program 1 times [2021-12-19 14:19:14,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:19:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764595489] [2021-12-19 14:19:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:14,420 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:19:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:19:14,421 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:19:14,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2021-12-19 14:19:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:15,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 68 conjunts are in the unsatisfiable core [2021-12-19 14:19:15,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:15,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:15,748 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:19:15,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:19:15,770 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:19:15,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:17,667 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:17,668 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:19:17,762 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:17,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:19:17,830 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:17,830 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:19:17,846 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:19:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:19:17,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:17,927 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_6870) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:19:17,934 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_6870) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:19:17,945 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:19:17,954 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:19:18,148 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6916 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6869 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_6870 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_6916))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6869)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_6870)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:19:18,150 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:19:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764595489] [2021-12-19 14:19:18,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764595489] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1485441181] [2021-12-19 14:19:18,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:18,150 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:19:18,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:19:18,151 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:19:18,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2021-12-19 14:19:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:23,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 14:19:23,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:23,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:23,310 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:19:23,311 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:19:23,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:19:23,372 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:25,146 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:25,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:19:25,214 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:25,214 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:19:25,251 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:25,252 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:19:25,270 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:19:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:19:25,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:25,290 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (_ bv1 1)))) is different from false [2021-12-19 14:19:25,298 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_7372) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:19:25,310 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:19:25,319 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:19:25,524 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_7371 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7372 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7418 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_7418))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7371)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7372)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:19:25,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1485441181] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:25,526 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:19:25,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2021-12-19 14:19:25,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629423979] [2021-12-19 14:19:25,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:19:25,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-19 14:19:25,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:19:25,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-19 14:19:25,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=253, Unknown=25, NotChecked=410, Total=756 [2021-12-19 14:19:25,527 INFO L87 Difference]: Start difference. First operand 1794 states and 2451 transitions. Second operand has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:19:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:19:30,905 INFO L93 Difference]: Finished difference Result 2911 states and 3923 transitions. [2021-12-19 14:19:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 14:19:30,906 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 138 [2021-12-19 14:19:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:19:30,908 INFO L225 Difference]: With dead ends: 2911 [2021-12-19 14:19:30,908 INFO L226 Difference]: Without dead ends: 2911 [2021-12-19 14:19:30,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 179 SyntacticMatches, 90 SemanticMatches, 31 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=95, Invalid=420, Unknown=31, NotChecked=510, Total=1056 [2021-12-19 14:19:30,909 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 1416 mSDsluCounter, 7529 mSDsCounter, 0 mSdLazyCounter, 4821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 8331 SdHoareTripleChecker+Invalid, 9165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 4821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4320 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2021-12-19 14:19:30,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1421 Valid, 8331 Invalid, 9165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 4821 Invalid, 0 Unknown, 4320 Unchecked, 5.2s Time] [2021-12-19 14:19:30,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2021-12-19 14:19:30,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 1793. [2021-12-19 14:19:30,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1347 states have (on average 1.7743132887899036) internal successors, (2390), 1756 states have internal predecessors, (2390), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:19:30,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2449 transitions. [2021-12-19 14:19:30,937 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2449 transitions. Word has length 138 [2021-12-19 14:19:30,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:19:30,938 INFO L470 AbstractCegarLoop]: Abstraction has 1793 states and 2449 transitions. [2021-12-19 14:19:30,938 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:19:30,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2449 transitions. [2021-12-19 14:19:30,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2021-12-19 14:19:30,940 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:19:30,941 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:19:30,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2021-12-19 14:19:31,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2021-12-19 14:19:31,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-19 14:19:31,374 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:19:31,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:19:31,375 INFO L85 PathProgramCache]: Analyzing trace with hash -573302593, now seen corresponding path program 1 times [2021-12-19 14:19:31,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:19:31,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220208493] [2021-12-19 14:19:31,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:31,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:19:31,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:19:31,377 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:19:31,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2021-12-19 14:19:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:19:32,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 126 conjunts are in the unsatisfiable core [2021-12-19 14:19:32,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:19:32,641 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:32,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:32,947 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:19:32,947 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:19:32,971 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:19:32,978 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:33,066 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:33,069 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:34,359 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917)))) is different from true [2021-12-19 14:19:34,397 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:34,398 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:19:34,401 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:19:34,486 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:34,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:19:34,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:19:34,562 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:19:34,563 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:19:34,566 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:19:34,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-19 14:19:34,599 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:19:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 903 trivial. 44 not checked. [2021-12-19 14:19:34,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:19:34,763 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:19:34,784 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:19:34,818 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) .cse0 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 14:19:34,853 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_7920) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_7922)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_7919))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_7920) .cse4 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 14:19:35,428 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014) .cse1 v_ArrVal_7920) (select (select (store .cse2 .cse1 v_ArrVal_7919) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_7922))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_7922 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7921 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7920 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8014 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8013 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_7919 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8013)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_7919))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8014) .cse4 v_ArrVal_7920) .cse5 v_ArrVal_7922) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_7921) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 14:19:35,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:19:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220208493] [2021-12-19 14:19:35,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220208493] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:19:35,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [333175010] [2021-12-19 14:19:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:19:35,437 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:19:35,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:19:35,438 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:19:35,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2021-12-19 14:22:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:22:27,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 939 conjuncts, 124 conjunts are in the unsatisfiable core [2021-12-19 14:22:27,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:22:27,218 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:27,387 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:27,411 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:22:27,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:22:27,451 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:22:27,459 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:27,574 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:27,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:28,783 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:28,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:22:28,787 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:22:28,901 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:28,901 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:22:28,912 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:22:28,988 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:28,989 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:22:28,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:22:29,014 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-19 14:22:29,016 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:22:29,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:22:29,067 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv8 32)) (bvadd .cse1 (_ bv12 32)))))) is different from false [2021-12-19 14:22:29,092 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv8 32)) (bvadd .cse2 (_ bv12 32)))))) is different from false [2021-12-19 14:22:29,129 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516)) (.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) .cse0 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse3 (_ bv8 32)) (bvadd .cse3 (_ bv12 32)))))) is different from false [2021-12-19 14:22:29,165 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_8516))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_8515) .cse1 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_8515) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_8518)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv8 32)) (bvadd .cse4 (_ bv12 32)))))) is different from false [2021-12-19 14:22:29,754 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610) .cse1 v_ArrVal_8515) (select (select (store .cse2 .cse1 v_ArrVal_8516) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_8518))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_8609 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8517 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8515 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_8610 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8609)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_8516))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_8610) .cse4 v_ArrVal_8515) .cse5 v_ArrVal_8518) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_8517) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 14:22:29,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [333175010] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:22:29,762 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:22:29,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2021-12-19 14:22:29,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641401366] [2021-12-19 14:22:29,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:22:29,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-19 14:22:29,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:22:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-19 14:22:29,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=563, Unknown=32, NotChecked=638, Total=1332 [2021-12-19 14:22:29,764 INFO L87 Difference]: Start difference. First operand 1793 states and 2449 transitions. Second operand has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:22:30,324 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_94 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_94) (_ bv44 32))) (exists ((v_ArrVal_7918 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7918))) (exists ((v_ArrVal_7917 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_7917))) (exists ((v_ArrVal_8513 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8513))) (exists ((v_ArrVal_8514 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_alt_bzero_#in~a#1.base| v_ArrVal_8514)))) is different from true [2021-12-19 14:22:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:22:39,093 INFO L93 Difference]: Finished difference Result 2912 states and 3923 transitions. [2021-12-19 14:22:39,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-19 14:22:39,115 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 138 [2021-12-19 14:22:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:22:39,117 INFO L225 Difference]: With dead ends: 2912 [2021-12-19 14:22:39,118 INFO L226 Difference]: Without dead ends: 2912 [2021-12-19 14:22:39,118 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 172 SyntacticMatches, 89 SemanticMatches, 47 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=187, Invalid=1148, Unknown=45, NotChecked=972, Total=2352 [2021-12-19 14:22:39,118 INFO L933 BasicCegarLoop]: 802 mSDtfsCounter, 2559 mSDsluCounter, 5140 mSDsCounter, 0 mSdLazyCounter, 8470 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2564 SdHoareTripleChecker+Valid, 5942 SdHoareTripleChecker+Invalid, 11120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 8470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2608 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2021-12-19 14:22:39,119 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2564 Valid, 5942 Invalid, 11120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 8470 Invalid, 0 Unknown, 2608 Unchecked, 8.9s Time] [2021-12-19 14:22:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2021-12-19 14:22:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 1792. [2021-12-19 14:22:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1792 states, 1347 states have (on average 1.7728285077951003) internal successors, (2388), 1755 states have internal predecessors, (2388), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:22:39,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 2447 transitions. [2021-12-19 14:22:39,155 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 2447 transitions. Word has length 138 [2021-12-19 14:22:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:22:39,155 INFO L470 AbstractCegarLoop]: Abstraction has 1792 states and 2447 transitions. [2021-12-19 14:22:39,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.409090909090909) internal successors, (163), 21 states have internal predecessors, (163), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2021-12-19 14:22:39,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 2447 transitions. [2021-12-19 14:22:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 14:22:39,156 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:22:39,156 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:22:39,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2021-12-19 14:22:39,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2021-12-19 14:22:39,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 14:22:39,557 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:22:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:22:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1827699965, now seen corresponding path program 1 times [2021-12-19 14:22:39,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:22:39,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769050921] [2021-12-19 14:22:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:22:39,558 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:22:39,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:22:39,560 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:22:39,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2021-12-19 14:22:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:22:40,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 70 conjunts are in the unsatisfiable core [2021-12-19 14:22:40,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:22:40,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:41,143 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:22:41,143 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:22:41,164 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:22:41,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:42,890 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:42,891 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:42,973 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:42,974 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:43,032 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:43,033 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:43,088 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:43,089 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:43,104 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:22:43,130 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:22:43,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:22:43,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_9082) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (_ bv1 1)))) is different from false [2021-12-19 14:22:43,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:43,241 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:43,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:43,279 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:43,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9081 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9080 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9128 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9128))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9080)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9081)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:43,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:22:43,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769050921] [2021-12-19 14:22:43,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769050921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:22:43,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2079720801] [2021-12-19 14:22:43,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:22:43,480 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:22:43,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:22:43,481 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:22:43,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Waiting until timeout for monitored process [2021-12-19 14:22:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:22:53,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 14:22:53,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:22:53,884 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:53,998 INFO L354 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2021-12-19 14:22:53,999 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 20 treesize of output 27 [2021-12-19 14:22:54,008 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:22:54,047 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:22:55,784 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:55,784 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:55,869 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:55,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:55,908 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:55,908 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:55,948 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:22:55,948 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 37 treesize of output 38 [2021-12-19 14:22:55,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 16 [2021-12-19 14:22:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:22:55,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:22:56,045 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:56,056 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:56,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:56,081 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:56,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_9082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9646 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9599 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_9598 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_9646))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9598)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9599)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_9082)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (_ bv1 1)))) is different from false [2021-12-19 14:22:56,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2079720801] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:22:56,304 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:22:56,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2021-12-19 14:22:56,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736270225] [2021-12-19 14:22:56,304 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:22:56,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-19 14:22:56,305 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:22:56,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-19 14:22:56,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=316, Unknown=30, NotChecked=506, Total=930 [2021-12-19 14:22:56,306 INFO L87 Difference]: Start difference. First operand 1792 states and 2447 transitions. Second operand has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:23:02,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 14:23:02,108 INFO L93 Difference]: Finished difference Result 2909 states and 3919 transitions. [2021-12-19 14:23:02,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-19 14:23:02,108 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 141 [2021-12-19 14:23:02,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-19 14:23:02,111 INFO L225 Difference]: With dead ends: 2909 [2021-12-19 14:23:02,111 INFO L226 Difference]: Without dead ends: 2909 [2021-12-19 14:23:02,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 187 SyntacticMatches, 91 SemanticMatches, 34 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=105, Invalid=503, Unknown=36, NotChecked=616, Total=1260 [2021-12-19 14:23:02,112 INFO L933 BasicCegarLoop]: 803 mSDtfsCounter, 1410 mSDsluCounter, 7580 mSDsCounter, 0 mSdLazyCounter, 4903 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 8383 SdHoareTripleChecker+Invalid, 8316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3386 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2021-12-19 14:23:02,112 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1415 Valid, 8383 Invalid, 8316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4903 Invalid, 0 Unknown, 3386 Unchecked, 5.6s Time] [2021-12-19 14:23:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2909 states. [2021-12-19 14:23:02,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2909 to 1791. [2021-12-19 14:23:02,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1791 states, 1347 states have (on average 1.771343726800297) internal successors, (2386), 1754 states have internal predecessors, (2386), 28 states have call successors, (28), 15 states have call predecessors, (28), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2021-12-19 14:23:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1791 states to 1791 states and 2445 transitions. [2021-12-19 14:23:02,138 INFO L78 Accepts]: Start accepts. Automaton has 1791 states and 2445 transitions. Word has length 141 [2021-12-19 14:23:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-19 14:23:02,139 INFO L470 AbstractCegarLoop]: Abstraction has 1791 states and 2445 transitions. [2021-12-19 14:23:02,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-19 14:23:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1791 states and 2445 transitions. [2021-12-19 14:23:02,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2021-12-19 14:23:02,139 INFO L506 BasicCegarLoop]: Found error trace [2021-12-19 14:23:02,140 INFO L514 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 14:23:02,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2021-12-19 14:23:02,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (40)] Ended with exit code 0 [2021-12-19 14:23:02,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2021-12-19 14:23:02,568 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATION === [alt_mallocErr0REQUIRES_VIOLATION, alt_mallocErr1REQUIRES_VIOLATION, alt_freeErr0REQUIRES_VIOLATION, alt_freeErr1REQUIRES_VIOLATION (and 527 more)] === [2021-12-19 14:23:02,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 14:23:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1827699966, now seen corresponding path program 1 times [2021-12-19 14:23:02,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-19 14:23:02,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976830535] [2021-12-19 14:23:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:23:02,569 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-19 14:23:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-19 14:23:02,579 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-19 14:23:02,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2021-12-19 14:23:04,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:23:04,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 129 conjunts are in the unsatisfiable core [2021-12-19 14:23:04,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:23:04,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:23:04,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:23:04,428 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:23:04,429 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:23:04,454 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:23:04,460 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:23:04,553 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:23:04,556 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:23:06,028 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:06,028 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:23:06,032 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:23:06,136 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:06,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:23:06,142 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:23:06,205 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:06,206 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:23:06,210 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:23:06,272 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:23:06,272 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:23:06,276 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:23:06,310 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2021-12-19 14:23:06,312 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:23:06,332 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:23:06,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:23:06,494 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2021-12-19 14:23:06,516 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:23:06,555 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10165)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:23:06,671 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10165))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10164) .cse1 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10164) (select (select (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) v_ArrVal_10167)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6)))) (bvule (bvadd .cse4 (_ bv20 32)) (bvadd .cse4 (_ bv24 32)))))) is different from false [2021-12-19 14:23:06,764 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse1 v_ArrVal_10164) (select (select (store .cse2 .cse1 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10167))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10162)) (.cse6 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse4 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (let ((.cse7 (store .cse8 .cse4 v_ArrVal_10165))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10163) .cse4 v_ArrVal_10164) .cse5 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6) (_ bv24 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse6))))))))) is different from false [2021-12-19 14:23:07,636 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10163) .cse1 v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_10162))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_10163) .cse8 v_ArrVal_10164) (select (select (store .cse9 .cse8 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10) v_ArrVal_10167)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse10)))) (bvule (bvadd .cse6 (_ bv20 32)) (bvadd .cse6 (_ bv24 32)))))) is different from false [2021-12-19 14:23:10,079 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10166 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_10162))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_10165))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258) .cse0 v_ArrVal_10163) .cse1 v_ArrVal_10164) .cse2 v_ArrVal_10167) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10166) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_10164 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10165 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10162 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10163 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10167 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10258 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10259 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse11 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10259))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (let ((.cse10 (store .cse12 .cse8 v_ArrVal_10162))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse11))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10258) .cse8 v_ArrVal_10163) .cse9 v_ArrVal_10164) (select (select (store .cse10 .cse9 v_ArrVal_10165) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11) v_ArrVal_10167))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse11)))) (bvule (bvadd .cse7 (_ bv20 32)) (bvadd .cse7 (_ bv24 32)))))) is different from false [2021-12-19 14:23:10,093 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-19 14:23:10,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976830535] [2021-12-19 14:23:10,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976830535] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:23:10,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1414857737] [2021-12-19 14:23:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 14:23:10,094 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-19 14:23:10,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-19 14:23:10,094 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-19 14:23:10,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (42)] Waiting until timeout for monitored process [2021-12-19 14:26:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 14:26:06,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 128 conjunts are in the unsatisfiable core [2021-12-19 14:26:06,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 14:26:06,238 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:26:06,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:26:06,943 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-19 14:26:06,944 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 14 [2021-12-19 14:26:07,127 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 13 treesize of output 9 [2021-12-19 14:26:07,150 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:26:07,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:26:07,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:26:11,689 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:26:11,689 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:26:11,697 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:26:12,014 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:26:12,015 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:26:12,025 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:26:12,278 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:26:12,278 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:26:12,285 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:26:12,522 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-19 14:26:12,523 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 46 treesize of output 45 [2021-12-19 14:26:12,531 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 24 [2021-12-19 14:26:12,578 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 [2021-12-19 14:26:12,585 INFO L388 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 7 [2021-12-19 14:26:12,596 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2021-12-19 14:26:12,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 14:26:12,676 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))) (forall ((v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem76#1.base| v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32))))) (bvule (bvadd .cse1 (_ bv20 32)) (bvadd .cse1 (_ bv24 32)))))) is different from false [2021-12-19 14:26:12,724 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv24 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (bvule (bvadd .cse2 (_ bv20 32)) (bvadd .cse2 (_ bv24 32)))))) is different from false [2021-12-19 14:26:12,791 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10778) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10777)) (.cse3 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem75#1.base| v_ArrVal_10778) .cse2 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) (_ bv24 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))) is different from false [2021-12-19 14:26:12,894 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10778) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_10779)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_10777))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_10778) .cse4 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5) (_ bv24 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse5))))))))) is different from false [2021-12-19 14:26:12,989 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10776)) (.cse2 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_10777))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10775) .cse0 v_ArrVal_10778) .cse1 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) (_ bv24 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10776))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem74#1.base| v_ArrVal_10775) .cse6 v_ArrVal_10778) (select (select (store .cse7 .cse6 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) v_ArrVal_10779))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8)))) (bvule (bvadd .cse5 (_ bv20 32)) (bvadd .cse5 (_ bv24 32)))))) is different from false [2021-12-19 14:26:14,047 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_10776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_10775) .cse2 v_ArrVal_10778) (select (select (store .cse3 .cse2 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10779)))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_10776))) (let ((.cse6 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_10777))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_10775) .cse6 v_ArrVal_10778) .cse7 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8) (_ bv24 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse8))))))))))) is different from false [2021-12-19 14:26:17,343 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_10872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10872))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (let ((.cse3 (store .cse5 .cse1 v_ArrVal_10776))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse4))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10871) .cse1 v_ArrVal_10775) .cse2 v_ArrVal_10778) (select (select (store .cse3 .cse2 v_ArrVal_10777) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4) v_ArrVal_10779))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse4)))) (bvule (bvadd .cse0 (_ bv20 32)) (bvadd .cse0 (_ bv24 32))))) (forall ((v_ArrVal_10780 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10872 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10871 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10777 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10778 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10775 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10776 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_10779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10872)) (.cse9 (bvadd |c_ULTIMATE.start_main_~user~0#1.offset| (_ bv8 32)))) (let ((.cse6 (select (select .cse12 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse11 (store .cse12 .cse6 v_ArrVal_10776))) (let ((.cse7 (select (select .cse11 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_10777))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem73#1.base| v_ArrVal_10871) .cse6 v_ArrVal_10775) .cse7 v_ArrVal_10778) .cse8 v_ArrVal_10779) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9) (_ bv24 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_10780) |c_ULTIMATE.start_main_~user~0#1.base|) .cse9))))))))))) is different from false [2021-12-19 14:26:17,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1414857737] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-19 14:26:17,358 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 14:26:17,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 25 [2021-12-19 14:26:17,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502643124] [2021-12-19 14:26:17,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 14:26:17,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2021-12-19 14:26:17,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-19 14:26:17,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2021-12-19 14:26:17,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=660, Unknown=37, NotChecked=910, Total=1722 [2021-12-19 14:26:17,359 INFO L87 Difference]: Start difference. First operand 1791 states and 2445 transitions. Second operand has 26 states, 23 states have (on average 7.173913043478261) internal successors, (165), 22 states have internal predecessors, (165), 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) Killed by 15