./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version eb692b52 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/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:10:10,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:10:10,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:10:11,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:10:11,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:10:11,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:10:11,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:10:11,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:10:11,036 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:10:11,040 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:10:11,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:10:11,043 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:10:11,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:10:11,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:10:11,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:10:11,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:10:11,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:10:11,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:10:11,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:10:11,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:10:11,061 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:10:11,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:10:11,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:10:11,064 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:10:11,065 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:10:11,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:10:11,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:10:11,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:10:11,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:10:11,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:10:11,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:10:11,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:10:11,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:10:11,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:10:11,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:10:11,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:10:11,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:10:11,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:10:11,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:10:11,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:10:11,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:10:11,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:10:11,084 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-20 05:10:11,117 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:10:11,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:10:11,119 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:10:11,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:10:11,120 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:10:11,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:10:11,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:10:11,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:10:11,121 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:10:11,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:10:11,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:10:11,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:10:11,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:10:11,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:10:11,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:10:11,123 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:10:11,123 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:10:11,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:10:11,124 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:10:11,124 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:10:11,124 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:10:11,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:10:11,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:10:11,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:10:11,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:10:11,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:10:11,126 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:10:11,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:10:11,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:10:11,126 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-memcleanup) ) 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2022-07-20 05:10:11,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:10:11,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:10:11,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:10:11,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:10:11,402 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:10:11,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2022-07-20 05:10:11,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b14efce8/7a99f1e7ab584f959cda9cdc54032fb0/FLAG0a9fcd43c [2022-07-20 05:10:11,865 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:10:11,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2022-07-20 05:10:11,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b14efce8/7a99f1e7ab584f959cda9cdc54032fb0/FLAG0a9fcd43c [2022-07-20 05:10:12,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b14efce8/7a99f1e7ab584f959cda9cdc54032fb0 [2022-07-20 05:10:12,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:10:12,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:10:12,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:10:12,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:10:12,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:10:12,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:10:12" (1/1) ... [2022-07-20 05:10:12,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e197f26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:12, skipping insertion in model container [2022-07-20 05:10:12,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:10:12" (1/1) ... [2022-07-20 05:10:12,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:10:12,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:10:12,427 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/list-properties/list_search-2.i[813,826] [2022-07-20 05:10:12,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:10:12,616 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-20 05:10:12,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7d48f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:12, skipping insertion in model container [2022-07-20 05:10:12,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:10:12,618 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 05:10:12,620 INFO L158 Benchmark]: Toolchain (without parser) took 401.91ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.6MB in the beginning and 76.5MB in the end (delta: -26.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:10:12,621 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 86.0MB. Free memory was 55.7MB in the beginning and 55.7MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:10:12,621 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.42ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.5MB in the beginning and 76.5MB in the end (delta: -27.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:10:12,623 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.20ms. Allocated memory is still 86.0MB. Free memory was 55.7MB in the beginning and 55.7MB in the end (delta: 29.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.42ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 49.5MB in the beginning and 76.5MB in the end (delta: -27.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 792]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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/list-properties/list_search-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:10:14,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:10:14,305 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:10:14,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:10:14,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:10:14,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:10:14,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:10:14,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:10:14,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:10:14,357 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:10:14,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:10:14,362 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:10:14,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:10:14,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:10:14,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:10:14,367 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:10:14,368 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:10:14,369 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:10:14,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:10:14,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:10:14,377 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:10:14,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:10:14,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:10:14,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:10:14,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:10:14,388 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:10:14,388 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:10:14,388 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:10:14,389 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:10:14,390 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:10:14,390 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:10:14,391 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:10:14,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:10:14,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:10:14,394 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:10:14,395 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:10:14,395 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:10:14,396 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:10:14,396 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:10:14,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:10:14,397 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:10:14,398 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:10:14,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-07-20 05:10:14,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:10:14,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:10:14,433 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:10:14,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:10:14,434 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:10:14,434 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:10:14,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:10:14,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:10:14,436 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:10:14,436 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:10:14,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:10:14,437 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:10:14,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:10:14,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:10:14,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:10:14,438 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:10:14,443 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:10:14,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:10:14,444 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:10:14,444 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:10:14,444 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:10:14,445 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:10:14,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:10:14,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:10:14,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:10:14,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:10:14,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:10:14,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:10:14,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:10:14,446 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:10:14,447 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:14,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:10:14,447 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-memcleanup) ) 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2022-07-20 05:10:14,739 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:10:14,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:10:14,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:10:14,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:10:14,770 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:10:14,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2022-07-20 05:10:14,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d265be1cf/f51932b28d6e467a8a3b7e876e2c3be8/FLAG447f71ec2 [2022-07-20 05:10:15,306 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:10:15,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2022-07-20 05:10:15,321 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d265be1cf/f51932b28d6e467a8a3b7e876e2c3be8/FLAG447f71ec2 [2022-07-20 05:10:15,624 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d265be1cf/f51932b28d6e467a8a3b7e876e2c3be8 [2022-07-20 05:10:15,627 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:10:15,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:10:15,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:10:15,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:10:15,633 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:10:15,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:10:15" (1/1) ... [2022-07-20 05:10:15,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a90324b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:15, skipping insertion in model container [2022-07-20 05:10:15,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:10:15" (1/1) ... [2022-07-20 05:10:15,641 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:10:15,686 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:10:15,830 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/list-properties/list_search-2.i[813,826] [2022-07-20 05:10:16,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:10:16,083 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 05:10:16,090 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:10:16,092 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/list-properties/list_search-2.i[813,826] [2022-07-20 05:10:16,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:10:16,134 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:10:16,148 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/list-properties/list_search-2.i[813,826] [2022-07-20 05:10:16,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:10:16,252 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:10:16,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16 WrapperNode [2022-07-20 05:10:16,254 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:10:16,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:10:16,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:10:16,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:10:16,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,324 INFO L137 Inliner]: procedures = 229, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 100 [2022-07-20 05:10:16,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:10:16,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:10:16,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:10:16,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:10:16,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,353 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,370 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:10:16,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:10:16,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:10:16,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:10:16,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (1/1) ... [2022-07-20 05:10:16,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:10:16,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:10:16,415 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) [2022-07-20 05:10:16,424 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 [2022-07-20 05:10:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 05:10:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:10:16,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 05:10:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:10:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 05:10:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:10:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:10:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:10:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2022-07-20 05:10:16,459 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2022-07-20 05:10:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:10:16,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:10:16,554 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:10:16,555 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:10:16,972 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:10:16,978 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:10:16,981 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-20 05:10:16,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:10:16 BoogieIcfgContainer [2022-07-20 05:10:16,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:10:16,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:10:16,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:10:16,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:10:16,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:10:15" (1/3) ... [2022-07-20 05:10:16,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a82d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:10:16, skipping insertion in model container [2022-07-20 05:10:16,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:10:16" (2/3) ... [2022-07-20 05:10:16,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53a82d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:10:16, skipping insertion in model container [2022-07-20 05:10:16,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:10:16" (3/3) ... [2022-07-20 05:10:16,991 INFO L111 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2022-07-20 05:10:17,003 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:10:17,003 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-20 05:10:17,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:10:17,068 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fc91894, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@28b2759d [2022-07-20 05:10:17,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-20 05:10:17,074 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 85 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:17,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:10:17,080 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:17,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:10:17,081 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:17,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:17,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1514693702, now seen corresponding path program 1 times [2022-07-20 05:10:17,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:17,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [112010465] [2022-07-20 05:10:17,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:17,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:17,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:17,100 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) [2022-07-20 05:10:17,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:10:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:17,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 05:10:17,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:17,258 INFO L390 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 [2022-07-20 05:10:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:17,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:17,271 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:17,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [112010465] [2022-07-20 05:10:17,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [112010465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:17,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:17,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:10:17,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450477067] [2022-07-20 05:10:17,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:17,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:10:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:10:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:10:17,304 INFO L87 Difference]: Start difference. First operand has 91 states, 52 states have (on average 1.8653846153846154) internal successors, (97), 85 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-20 05:10:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:17,440 INFO L93 Difference]: Finished difference Result 87 states and 96 transitions. [2022-07-20 05:10:17,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:10:17,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-20 05:10:17,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:17,449 INFO L225 Difference]: With dead ends: 87 [2022-07-20 05:10:17,450 INFO L226 Difference]: Without dead ends: 85 [2022-07-20 05:10:17,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:10:17,454 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 11 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:17,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 140 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:10:17,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-20 05:10:17,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-07-20 05:10:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 79 states have internal predecessors, (86), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:17,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2022-07-20 05:10:17,486 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 6 [2022-07-20 05:10:17,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:17,487 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2022-07-20 05:10:17,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-20 05:10:17,487 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2022-07-20 05:10:17,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:10:17,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:17,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:10:17,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-20 05:10:17,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:17,688 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1514693703, now seen corresponding path program 1 times [2022-07-20 05:10:17,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:17,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062990527] [2022-07-20 05:10:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:17,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:17,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:17,692 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) [2022-07-20 05:10:17,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:10:17,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:17,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:10:17,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:17,751 INFO L390 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 [2022-07-20 05:10:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:17,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:17,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:17,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062990527] [2022-07-20 05:10:17,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062990527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:17,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:17,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:10:17,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377820013] [2022-07-20 05:10:17,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:17,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:10:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:17,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:10:17,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:10:17,770 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-20 05:10:17,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:17,950 INFO L93 Difference]: Finished difference Result 81 states and 90 transitions. [2022-07-20 05:10:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:10:17,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-07-20 05:10:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:17,954 INFO L225 Difference]: With dead ends: 81 [2022-07-20 05:10:17,954 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 05:10:17,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:10:17,956 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:17,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:10:17,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 05:10:17,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-07-20 05:10:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.607843137254902) internal successors, (82), 75 states have internal predecessors, (82), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:17,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2022-07-20 05:10:17,966 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 6 [2022-07-20 05:10:17,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:17,966 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2022-07-20 05:10:17,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-07-20 05:10:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2022-07-20 05:10:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 05:10:17,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:17,969 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:17,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:18,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:18,176 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:18,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:18,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1345131113, now seen corresponding path program 1 times [2022-07-20 05:10:18,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:18,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263303045] [2022-07-20 05:10:18,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:18,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:18,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:18,180 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) [2022-07-20 05:10:18,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:10:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:18,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:10:18,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:18,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:18,493 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 05:10:18,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:18,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263303045] [2022-07-20 05:10:18,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [263303045] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:18,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:18,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-07-20 05:10:18,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346001863] [2022-07-20 05:10:18,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:18,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:10:18,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:10:18,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:10:18,501 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 05:10:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:18,694 INFO L93 Difference]: Finished difference Result 111 states and 120 transitions. [2022-07-20 05:10:18,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:10:18,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 40 [2022-07-20 05:10:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:18,697 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:10:18,698 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:10:18,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:10:18,702 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 90 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:18,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 339 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:10:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:10:18,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2022-07-20 05:10:18,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 79 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:10:18,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2022-07-20 05:10:18,730 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 40 [2022-07-20 05:10:18,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:18,730 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2022-07-20 05:10:18,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 05:10:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2022-07-20 05:10:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 05:10:18,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:18,734 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:18,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:18,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:18,934 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:18,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:18,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1982971279, now seen corresponding path program 1 times [2022-07-20 05:10:18,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:18,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226256587] [2022-07-20 05:10:18,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:18,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:18,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:18,939 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) [2022-07-20 05:10:18,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:10:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:19,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:10:19,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:19,123 INFO L390 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 [2022-07-20 05:10:19,148 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 05:10:19,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:19,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:19,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226256587] [2022-07-20 05:10:19,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226256587] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:19,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:19,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:10:19,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750760602] [2022-07-20 05:10:19,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:19,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:10:19,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:19,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:10:19,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:10:19,151 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:19,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:19,443 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-07-20 05:10:19,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:10:19,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-07-20 05:10:19,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:19,446 INFO L225 Difference]: With dead ends: 166 [2022-07-20 05:10:19,446 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 05:10:19,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:10:19,447 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 191 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:19,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 148 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:10:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 05:10:19,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 88. [2022-07-20 05:10:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 81 states have internal predecessors, (90), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:10:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2022-07-20 05:10:19,456 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 40 [2022-07-20 05:10:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:19,457 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2022-07-20 05:10:19,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2022-07-20 05:10:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 05:10:19,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:19,458 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:19,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:19,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:19,659 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:19,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:19,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1982971278, now seen corresponding path program 1 times [2022-07-20 05:10:19,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:19,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [802583887] [2022-07-20 05:10:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:19,662 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) [2022-07-20 05:10:19,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 05:10:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:19,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:10:19,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:19,847 INFO L390 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 [2022-07-20 05:10:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 05:10:19,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:19,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:19,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [802583887] [2022-07-20 05:10:19,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [802583887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:19,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:19,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:10:19,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971866041] [2022-07-20 05:10:19,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:19,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:10:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:19,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:10:19,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:10:19,919 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:20,257 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2022-07-20 05:10:20,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:10:20,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 40 [2022-07-20 05:10:20,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:20,259 INFO L225 Difference]: With dead ends: 184 [2022-07-20 05:10:20,259 INFO L226 Difference]: Without dead ends: 184 [2022-07-20 05:10:20,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:10:20,261 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 216 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:20,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 156 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:10:20,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-20 05:10:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 97. [2022-07-20 05:10:20,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.621212121212121) internal successors, (107), 90 states have internal predecessors, (107), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:10:20,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2022-07-20 05:10:20,270 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 40 [2022-07-20 05:10:20,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:20,270 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2022-07-20 05:10:20,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:20,271 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2022-07-20 05:10:20,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 05:10:20,272 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:20,272 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:20,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:20,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:20,484 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:20,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:20,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1718799074, now seen corresponding path program 1 times [2022-07-20 05:10:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:20,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [142505553] [2022-07-20 05:10:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:20,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:20,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:20,486 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) [2022-07-20 05:10:20,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:10:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:20,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:10:20,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:20,672 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-20 05:10:20,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:20,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [142505553] [2022-07-20 05:10:20,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [142505553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:20,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:20,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:10:20,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352871885] [2022-07-20 05:10:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:20,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:10:20,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:10:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:10:20,675 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:20,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:20,804 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-07-20 05:10:20,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:10:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-07-20 05:10:20,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:20,805 INFO L225 Difference]: With dead ends: 118 [2022-07-20 05:10:20,805 INFO L226 Difference]: Without dead ends: 118 [2022-07-20 05:10:20,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:10:20,807 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 94 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:20,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 242 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:10:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-20 05:10:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2022-07-20 05:10:20,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 66 states have (on average 1.5909090909090908) internal successors, (105), 90 states have internal predecessors, (105), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:10:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2022-07-20 05:10:20,814 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 43 [2022-07-20 05:10:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:20,814 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2022-07-20 05:10:20,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2022-07-20 05:10:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 05:10:20,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:20,815 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:20,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:21,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:21,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:21,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:21,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1717169730, now seen corresponding path program 1 times [2022-07-20 05:10:21,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:21,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558090319] [2022-07-20 05:10:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:21,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:21,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:21,022 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) [2022-07-20 05:10:21,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:10:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:21,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:10:21,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:21,317 INFO L390 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 [2022-07-20 05:10:21,423 INFO L390 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 [2022-07-20 05:10:21,506 INFO L356 Elim1Store]: treesize reduction 30, result has 31.8 percent of original size [2022-07-20 05:10:21,507 INFO L390 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 18 treesize of output 23 [2022-07-20 05:10:21,570 INFO L390 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 11 [2022-07-20 05:10:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:21,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:21,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:21,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558090319] [2022-07-20 05:10:21,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558090319] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:21,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:21,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-07-20 05:10:21,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651297148] [2022-07-20 05:10:21,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:21,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:10:21,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:21,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:10:21,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:10:21,980 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 17 states, 16 states have (on average 2.5625) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 05:10:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:23,036 INFO L93 Difference]: Finished difference Result 179 states and 193 transitions. [2022-07-20 05:10:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:10:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2022-07-20 05:10:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:23,038 INFO L225 Difference]: With dead ends: 179 [2022-07-20 05:10:23,038 INFO L226 Difference]: Without dead ends: 179 [2022-07-20 05:10:23,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:10:23,039 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 509 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:23,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 390 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:10:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-20 05:10:23,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 102. [2022-07-20 05:10:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5774647887323943) internal successors, (112), 95 states have internal predecessors, (112), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:23,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 120 transitions. [2022-07-20 05:10:23,046 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 120 transitions. Word has length 43 [2022-07-20 05:10:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:23,046 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 120 transitions. [2022-07-20 05:10:23,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5625) internal successors, (41), 14 states have internal predecessors, (41), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 05:10:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 120 transitions. [2022-07-20 05:10:23,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 05:10:23,047 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:23,047 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:23,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:23,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:23,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:23,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:23,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1717169729, now seen corresponding path program 1 times [2022-07-20 05:10:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:23,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637849340] [2022-07-20 05:10:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:23,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:23,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:23,250 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) [2022-07-20 05:10:23,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:10:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:23,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:10:23,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:23,503 INFO L390 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 [2022-07-20 05:10:23,634 INFO L390 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 [2022-07-20 05:10:23,640 INFO L390 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 [2022-07-20 05:10:23,728 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-20 05:10:23,728 INFO L390 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 18 treesize of output 20 [2022-07-20 05:10:23,804 INFO L390 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 17 treesize of output 9 [2022-07-20 05:10:23,809 INFO L390 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 [2022-07-20 05:10:23,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:23,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:24,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:24,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637849340] [2022-07-20 05:10:24,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637849340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:24,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [365253551] [2022-07-20 05:10:24,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:24,408 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:24,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:10:24,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:10:24,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-07-20 05:10:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:24,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 05:10:24,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:24,729 INFO L390 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 [2022-07-20 05:10:24,734 INFO L390 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 [2022-07-20 05:10:24,997 INFO L390 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 [2022-07-20 05:10:25,008 INFO L390 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 [2022-07-20 05:10:25,200 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:10:25,201 INFO L390 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 18 treesize of output 18 [2022-07-20 05:10:25,209 INFO L390 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 18 treesize of output 20 [2022-07-20 05:10:25,331 INFO L390 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 [2022-07-20 05:10:25,335 INFO L390 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 [2022-07-20 05:10:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:25,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:26,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [365253551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:26,471 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:26,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-07-20 05:10:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248961132] [2022-07-20 05:10:26,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:26,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-20 05:10:26,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-20 05:10:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2022-07-20 05:10:26,474 INFO L87 Difference]: Start difference. First operand 102 states and 120 transitions. Second operand has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 05:10:28,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:28,768 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2022-07-20 05:10:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:10:28,768 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-07-20 05:10:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:28,769 INFO L225 Difference]: With dead ends: 191 [2022-07-20 05:10:28,770 INFO L226 Difference]: Without dead ends: 191 [2022-07-20 05:10:28,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=281, Invalid=1525, Unknown=0, NotChecked=0, Total=1806 [2022-07-20 05:10:28,771 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 535 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:28,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 580 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 831 Invalid, 0 Unknown, 300 Unchecked, 1.2s Time] [2022-07-20 05:10:28,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-20 05:10:28,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2022-07-20 05:10:28,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5633802816901408) internal successors, (111), 95 states have internal predecessors, (111), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:28,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 119 transitions. [2022-07-20 05:10:28,776 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 119 transitions. Word has length 43 [2022-07-20 05:10:28,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:28,777 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 119 transitions. [2022-07-20 05:10:28,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.526315789473684) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 05:10:28,777 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 119 transitions. [2022-07-20 05:10:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:10:28,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:28,778 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:28,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-20 05:10:28,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:29,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:29,179 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:29,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:29,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1150420657, now seen corresponding path program 1 times [2022-07-20 05:10:29,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:29,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899593314] [2022-07-20 05:10:29,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:29,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:29,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:29,182 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) [2022-07-20 05:10:29,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 05:10:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:29,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:10:29,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:29,415 INFO L390 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 [2022-07-20 05:10:29,509 INFO L390 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 16 treesize of output 8 [2022-07-20 05:10:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:29,532 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-20 05:10:29,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:29,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899593314] [2022-07-20 05:10:29,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899593314] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:29,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:29,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2022-07-20 05:10:29,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2578847] [2022-07-20 05:10:29,760 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:29,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:10:29,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:29,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:10:29,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:10:29,764 INFO L87 Difference]: Start difference. First operand 102 states and 119 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 05:10:30,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:30,653 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2022-07-20 05:10:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:10:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-07-20 05:10:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:30,656 INFO L225 Difference]: With dead ends: 128 [2022-07-20 05:10:30,656 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 05:10:30,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=957, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:10:30,657 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 299 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:30,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 665 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 05:10:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 05:10:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 102. [2022-07-20 05:10:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 71 states have (on average 1.5492957746478873) internal successors, (110), 95 states have internal predecessors, (110), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2022-07-20 05:10:30,662 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 46 [2022-07-20 05:10:30,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:30,663 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2022-07-20 05:10:30,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 14 states have internal predecessors, (44), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-20 05:10:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2022-07-20 05:10:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:10:30,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:30,664 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:30,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:30,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:30,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:30,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1152050001, now seen corresponding path program 2 times [2022-07-20 05:10:30,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:30,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143243978] [2022-07-20 05:10:30,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:10:30,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:30,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:30,877 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) [2022-07-20 05:10:30,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 05:10:31,129 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:10:31,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:31,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 05:10:31,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:31,148 INFO L390 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 [2022-07-20 05:10:31,232 INFO L390 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 [2022-07-20 05:10:31,311 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:31,312 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:31,508 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:31,529 INFO L390 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 [2022-07-20 05:10:31,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:31,710 INFO L390 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 54 treesize of output 50 [2022-07-20 05:10:31,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:31,741 INFO L356 Elim1Store]: treesize reduction 69, result has 41.5 percent of original size [2022-07-20 05:10:31,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 77 [2022-07-20 05:10:31,944 INFO L390 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 77 treesize of output 57 [2022-07-20 05:10:32,150 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:10:32,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2022-07-20 05:10:32,289 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 31 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:10:32,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:32,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:32,799 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:10:32,809 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_93 (_ BitVec 32))) (or (not (= (select v_arrayElimArr_2 (_ bv4 32)) c_~head~0.base)) (= (select (store |c_#valid| v_~head~0.base_93 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_93 v_arrayElimArr_2) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32)))) (_ bv1 1)) (not (= (bvneg (select |c_#valid| v_~head~0.base_93)) (_ bv0 1))))) is different from false [2022-07-20 05:10:32,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:32,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143243978] [2022-07-20 05:10:32,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143243978] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:32,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2026555089] [2022-07-20 05:10:32,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:10:32,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:10:32,812 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:10:32,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-07-20 05:10:33,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:10:33,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:33,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-20 05:10:33,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:33,107 INFO L390 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 [2022-07-20 05:10:33,158 INFO L390 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 [2022-07-20 05:10:33,197 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:33,197 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:33,350 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:33,362 INFO L390 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 [2022-07-20 05:10:33,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:33,448 INFO L390 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 54 treesize of output 50 [2022-07-20 05:10:33,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:33,479 INFO L356 Elim1Store]: treesize reduction 69, result has 41.5 percent of original size [2022-07-20 05:10:33,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 77 [2022-07-20 05:10:33,554 INFO L390 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 77 treesize of output 57 [2022-07-20 05:10:33,700 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:10:33,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2022-07-20 05:10:33,779 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 29 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:10:33,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:34,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:34,003 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-07-20 05:10:34,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_99 (_ BitVec 32)) (v_arrayElimArr_4 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select v_arrayElimArr_4 (_ bv4 32)) c_~head~0.base)) (not (= (bvneg (select |c_#valid| v_~head~0.base_99)) (_ bv0 1))) (= (_ bv1 1) (select (store |c_#valid| v_~head~0.base_99 (_ bv1 1)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_99 v_arrayElimArr_4) c_~head~0.base) (bvadd c_~head~0.offset (_ bv4 32))))))) is different from false [2022-07-20 05:10:34,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2026555089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:34,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:34,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2022-07-20 05:10:34,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196533091] [2022-07-20 05:10:34,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:34,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:10:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:34,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:10:34,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=625, Unknown=3, NotChecked=102, Total=812 [2022-07-20 05:10:34,018 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 21 states, 20 states have (on average 2.0) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 05:10:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:34,896 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2022-07-20 05:10:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:10:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 46 [2022-07-20 05:10:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:34,898 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:10:34,898 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:10:34,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=142, Invalid=980, Unknown=8, NotChecked=130, Total=1260 [2022-07-20 05:10:34,899 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 14 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:34,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 772 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 303 Invalid, 0 Unknown, 322 Unchecked, 0.4s Time] [2022-07-20 05:10:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:10:34,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2022-07-20 05:10:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.554054054054054) internal successors, (115), 98 states have internal predecessors, (115), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2022-07-20 05:10:34,903 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 46 [2022-07-20 05:10:34,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:34,904 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2022-07-20 05:10:34,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.0) internal successors, (40), 18 states have internal predecessors, (40), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 05:10:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2022-07-20 05:10:34,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:10:34,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:34,906 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:34,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:35,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:35,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:35,307 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:35,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:35,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1152050002, now seen corresponding path program 2 times [2022-07-20 05:10:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:35,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958454249] [2022-07-20 05:10:35,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:10:35,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:35,310 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) [2022-07-20 05:10:35,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 05:10:35,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:10:35,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:35,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 05:10:35,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:35,620 INFO L390 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 [2022-07-20 05:10:35,624 INFO L390 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 [2022-07-20 05:10:35,765 INFO L390 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 [2022-07-20 05:10:35,775 INFO L390 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 [2022-07-20 05:10:35,889 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 05:10:35,889 INFO L390 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 18 treesize of output 30 [2022-07-20 05:10:35,913 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:35,913 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:36,193 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:36,207 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:36,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:36,408 INFO L390 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 69 treesize of output 59 [2022-07-20 05:10:36,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:36,416 INFO L390 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 26 treesize of output 28 [2022-07-20 05:10:36,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:36,438 INFO L356 Elim1Store]: treesize reduction 4, result has 84.6 percent of original size [2022-07-20 05:10:36,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2022-07-20 05:10:36,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-07-20 05:10:36,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:36,939 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:10:36,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 50 [2022-07-20 05:10:36,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2022-07-20 05:10:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:10:37,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:38,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:38,065 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-20 05:10:38,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:38,083 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-20 05:10:38,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:38,091 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-20 05:10:38,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_105 (_ BitVec 32)) (v_ArrVal_1122 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1123 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_105))))) (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_105 (store v_ArrVal_1123 (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse2))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (and (bvule (bvadd (_ bv4 32) .cse0) .cse1) (bvule .cse1 (select (store |c_#length| v_~head~0.base_105 (_ bv8 32)) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_105 (store v_ArrVal_1122 (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse2))))))))) is different from false [2022-07-20 05:10:38,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958454249] [2022-07-20 05:10:38,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958454249] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:38,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [645307728] [2022-07-20 05:10:38,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:10:38,157 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:38,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:10:38,158 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:10:38,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-07-20 05:10:38,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:10:38,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:38,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 05:10:38,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:38,530 INFO L390 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 [2022-07-20 05:10:38,533 INFO L390 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 [2022-07-20 05:10:38,654 INFO L390 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 [2022-07-20 05:10:38,661 INFO L390 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 [2022-07-20 05:10:38,711 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:38,712 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:38,734 INFO L390 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 18 treesize of output 20 [2022-07-20 05:10:39,073 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:39,081 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:39,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:39,383 INFO L390 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 69 treesize of output 59 [2022-07-20 05:10:39,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:39,402 INFO L356 Elim1Store]: treesize reduction 4, result has 83.3 percent of original size [2022-07-20 05:10:39,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2022-07-20 05:10:39,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 05:10:39,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:39,425 INFO L390 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 26 treesize of output 28 [2022-07-20 05:10:39,972 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:39,978 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:10:39,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 50 [2022-07-20 05:10:39,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 15 [2022-07-20 05:10:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 17 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:10:40,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:40,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:40,395 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 38 [2022-07-20 05:10:40,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:40,401 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2022-07-20 05:10:40,422 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:40,422 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-20 05:10:40,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1243 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_111 (_ BitVec 32)) (v_ArrVal_1242 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1241 (_ BitVec 32))) (or (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_111 (store v_ArrVal_1243 (_ bv4 32) c_~head~0.offset)) c_~head~0.base) .cse1))) (let ((.cse0 (bvadd (_ bv8 32) .cse2))) (and (bvule .cse0 (select (store |c_#length| v_~head~0.base_111 v_ArrVal_1241) (select (select (store |c_#memory_$Pointer$.base| v_~head~0.base_111 (store v_ArrVal_1242 (_ bv4 32) c_~head~0.base)) c_~head~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) .cse0))))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_111)))))) is different from false [2022-07-20 05:10:40,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [645307728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:40,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:40,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2022-07-20 05:10:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102739673] [2022-07-20 05:10:40,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:40,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 05:10:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:40,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 05:10:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1154, Unknown=15, NotChecked=138, Total=1406 [2022-07-20 05:10:40,486 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:10:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:42,529 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2022-07-20 05:10:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:10:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-07-20 05:10:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:42,531 INFO L225 Difference]: With dead ends: 112 [2022-07-20 05:10:42,531 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 05:10:42,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=199, Invalid=2123, Unknown=38, NotChecked=190, Total=2550 [2022-07-20 05:10:42,532 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 17 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:42,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 992 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 553 Invalid, 0 Unknown, 530 Unchecked, 0.7s Time] [2022-07-20 05:10:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 05:10:42,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2022-07-20 05:10:42,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 98 states have internal predecessors, (114), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:42,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2022-07-20 05:10:42,536 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 46 [2022-07-20 05:10:42,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:42,536 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2022-07-20 05:10:42,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 26 states have internal predecessors, (53), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:10:42,537 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2022-07-20 05:10:42,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:10:42,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:42,538 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:42,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2022-07-20 05:10:42,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:42,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:42,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -363698114, now seen corresponding path program 2 times [2022-07-20 05:10:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:42,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [766904692] [2022-07-20 05:10:42,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:10:42,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:42,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:42,947 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) [2022-07-20 05:10:42,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 05:10:43,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 05:10:43,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:43,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:10:43,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 05:10:43,088 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:43,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:43,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [766904692] [2022-07-20 05:10:43,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [766904692] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:43,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:43,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:10:43,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118802897] [2022-07-20 05:10:43,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:43,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:10:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:10:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:10:43,090 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:43,303 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2022-07-20 05:10:43,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:10:43,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-20 05:10:43,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:43,305 INFO L225 Difference]: With dead ends: 168 [2022-07-20 05:10:43,305 INFO L226 Difference]: Without dead ends: 168 [2022-07-20 05:10:43,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:10:43,306 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 170 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:43,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 150 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:10:43,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-20 05:10:43,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 110. [2022-07-20 05:10:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.5569620253164558) internal successors, (123), 103 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:43,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2022-07-20 05:10:43,310 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 49 [2022-07-20 05:10:43,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:43,310 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2022-07-20 05:10:43,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:43,310 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2022-07-20 05:10:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:10:43,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:43,311 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:43,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:43,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:43,512 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:43,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash -363698113, now seen corresponding path program 1 times [2022-07-20 05:10:43,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:43,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133600067] [2022-07-20 05:10:43,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:43,513 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:43,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:43,514 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) [2022-07-20 05:10:43,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 05:10:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:43,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:10:43,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:43,710 INFO L390 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 [2022-07-20 05:10:43,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-20 05:10:43,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:10:43,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:43,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133600067] [2022-07-20 05:10:43,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133600067] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:43,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:43,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:10:43,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44133352] [2022-07-20 05:10:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:43,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:10:43,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:43,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:10:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:10:43,776 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:44,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:44,049 INFO L93 Difference]: Finished difference Result 198 states and 215 transitions. [2022-07-20 05:10:44,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:10:44,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-07-20 05:10:44,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:44,051 INFO L225 Difference]: With dead ends: 198 [2022-07-20 05:10:44,051 INFO L226 Difference]: Without dead ends: 198 [2022-07-20 05:10:44,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:10:44,052 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 202 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:44,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 173 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:10:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-20 05:10:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 113. [2022-07-20 05:10:44,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 106 states have internal predecessors, (126), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:44,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 134 transitions. [2022-07-20 05:10:44,056 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 134 transitions. Word has length 49 [2022-07-20 05:10:44,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:44,056 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 134 transitions. [2022-07-20 05:10:44,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:10:44,057 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 134 transitions. [2022-07-20 05:10:44,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:10:44,057 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:44,058 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:44,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:44,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:44,267 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:44,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash -362068770, now seen corresponding path program 3 times [2022-07-20 05:10:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:44,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718673289] [2022-07-20 05:10:44,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:10:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:44,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:44,269 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) [2022-07-20 05:10:44,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 05:10:44,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:10:44,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:44,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-20 05:10:44,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:44,641 INFO L390 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 [2022-07-20 05:10:44,712 INFO L390 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 [2022-07-20 05:10:44,772 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:44,772 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:44,937 INFO L390 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 [2022-07-20 05:10:44,942 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:45,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,071 INFO L390 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 54 treesize of output 50 [2022-07-20 05:10:45,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,092 INFO L356 Elim1Store]: treesize reduction 69, result has 41.5 percent of original size [2022-07-20 05:10:45,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 77 [2022-07-20 05:10:45,347 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:45,355 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:45,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,586 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-20 05:10:45,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 162 treesize of output 126 [2022-07-20 05:10:45,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,595 INFO L390 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 178 treesize of output 156 [2022-07-20 05:10:45,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:45,636 INFO L356 Elim1Store]: treesize reduction 141, result has 40.8 percent of original size [2022-07-20 05:10:45,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 152 [2022-07-20 05:10:46,233 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 05:10:46,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 142 [2022-07-20 05:10:46,580 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-20 05:10:46,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 53 [2022-07-20 05:10:46,836 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:46,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:47,607 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:47,607 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-20 05:10:47,616 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:47,616 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-07-20 05:10:47,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_19 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_117 (_ BitVec 32))) (let ((.cse0 (store |c_#valid| v_~head~0.base_117 (_ bv1 1)))) (or (= (_ bv1 1) (select .cse0 (let ((.cse2 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse1 (store |c_#memory_$Pointer$.base| v_~head~0.base_117 v_arrayElimArr_18))) (select .cse1 (select (select .cse1 c_~head~0.base) .cse2))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_117 v_arrayElimArr_19) c_~head~0.base) .cse2) (_ bv4 32)))))) (not (= c_~head~0.offset (select v_arrayElimArr_19 (_ bv4 32)))) (not (= (select v_arrayElimArr_18 (_ bv4 32)) c_~head~0.base)) (not (= (select .cse0 c_~head~0.base) (_ bv1 1))) (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_117))))))) is different from false [2022-07-20 05:10:47,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:47,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718673289] [2022-07-20 05:10:47,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [718673289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:47,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [507107205] [2022-07-20 05:10:47,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:10:47,646 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:47,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:10:47,647 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:10:47,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2022-07-20 05:10:48,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:10:48,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:48,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-20 05:10:48,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:48,028 INFO L390 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 [2022-07-20 05:10:48,077 INFO L390 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 [2022-07-20 05:10:48,117 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:48,117 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:48,318 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:48,327 INFO L390 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 [2022-07-20 05:10:48,469 INFO L356 Elim1Store]: treesize reduction 66, result has 42.6 percent of original size [2022-07-20 05:10:48,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 66 [2022-07-20 05:10:48,478 INFO L390 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 51 treesize of output 41 [2022-07-20 05:10:48,724 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:48,730 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:48,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:48,849 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-20 05:10:48,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 90 [2022-07-20 05:10:48,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:48,859 INFO L390 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 130 treesize of output 108 [2022-07-20 05:10:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:48,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:48,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:48,900 INFO L356 Elim1Store]: treesize reduction 93, result has 41.1 percent of original size [2022-07-20 05:10:48,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 112 [2022-07-20 05:10:49,401 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 05:10:49,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 253 treesize of output 142 [2022-07-20 05:10:49,670 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-20 05:10:49,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 53 [2022-07-20 05:10:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:49,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:50,447 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:50,447 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 45 [2022-07-20 05:10:50,452 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:50,452 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 42 [2022-07-20 05:10:50,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_~head~0.base_123 (_ BitVec 32)) (v_arrayElimArr_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_24 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv1 1) (select (store |c_#valid| v_~head~0.base_123 (_ bv1 1)) (let ((.cse1 (bvadd c_~head~0.offset (_ bv4 32)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| v_~head~0.base_123 v_arrayElimArr_23))) (select .cse0 (select (select .cse0 c_~head~0.base) .cse1))) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| v_~head~0.base_123 v_arrayElimArr_24) c_~head~0.base) .cse1)))))) (not (= (bvneg (select |c_#valid| v_~head~0.base_123)) (_ bv0 1))) (not (= c_~head~0.base (select v_arrayElimArr_23 (_ bv4 32)))) (not (= c_~head~0.offset (select v_arrayElimArr_24 (_ bv4 32)))))) is different from false [2022-07-20 05:10:50,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [507107205] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:50,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:10:50,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 29 [2022-07-20 05:10:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556561743] [2022-07-20 05:10:50,473 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 05:10:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:10:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 05:10:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1566, Unknown=16, NotChecked=162, Total=1892 [2022-07-20 05:10:50,475 INFO L87 Difference]: Start difference. First operand 113 states and 134 transitions. Second operand has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 26 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:52,124 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-07-20 05:10:52,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 05:10:52,125 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 26 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 49 [2022-07-20 05:10:52,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:52,126 INFO L225 Difference]: With dead ends: 127 [2022-07-20 05:10:52,126 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 05:10:52,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=290, Invalid=2650, Unknown=38, NotChecked=214, Total=3192 [2022-07-20 05:10:52,127 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 21 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:52,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 678 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 383 Invalid, 0 Unknown, 310 Unchecked, 0.5s Time] [2022-07-20 05:10:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 05:10:52,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2022-07-20 05:10:52,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 109 states have internal predecessors, (131), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:52,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2022-07-20 05:10:52,131 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 49 [2022-07-20 05:10:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:52,132 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2022-07-20 05:10:52,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.5517241379310345) internal successors, (45), 26 states have internal predecessors, (45), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:10:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2022-07-20 05:10:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:10:52,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:52,133 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:52,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:52,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:52,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:10:52,538 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:10:52,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:52,538 INFO L85 PathProgramCache]: Analyzing trace with hash -362068769, now seen corresponding path program 3 times [2022-07-20 05:10:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:10:52,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119475498] [2022-07-20 05:10:52,539 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:10:52,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:10:52,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:10:52,540 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) [2022-07-20 05:10:52,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 05:10:52,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:10:52,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:52,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-20 05:10:52,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:52,943 INFO L390 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 [2022-07-20 05:10:52,948 INFO L390 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 [2022-07-20 05:10:53,101 INFO L390 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 [2022-07-20 05:10:53,111 INFO L390 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 [2022-07-20 05:10:53,206 INFO L356 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-07-20 05:10:53,206 INFO L390 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 18 treesize of output 20 [2022-07-20 05:10:53,227 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:53,228 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:53,463 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:53,472 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:53,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:53,640 INFO L390 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 51 treesize of output 41 [2022-07-20 05:10:53,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:53,648 INFO L390 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 20 treesize of output 22 [2022-07-20 05:10:53,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:53,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:53,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-20 05:10:53,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:53,675 INFO L356 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2022-07-20 05:10:53,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27 [2022-07-20 05:10:53,966 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:53,979 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:54,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:54,217 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-20 05:10:54,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 70 [2022-07-20 05:10:54,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:54,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:54,263 INFO L356 Elim1Store]: treesize reduction 64, result has 26.4 percent of original size [2022-07-20 05:10:54,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 48 [2022-07-20 05:10:54,284 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-20 05:10:54,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-20 05:10:54,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:54,314 INFO L356 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-07-20 05:10:54,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 56 [2022-07-20 05:10:54,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2022-07-20 05:10:55,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:55,816 INFO L356 Elim1Store]: treesize reduction 79, result has 19.4 percent of original size [2022-07-20 05:10:55,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 231 treesize of output 125 [2022-07-20 05:10:55,851 INFO L356 Elim1Store]: treesize reduction 98, result has 6.7 percent of original size [2022-07-20 05:10:55,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 110 [2022-07-20 05:10:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 05:10:56,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:57,857 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:57,857 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 80 [2022-07-20 05:10:57,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:57,864 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2022-07-20 05:10:57,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:57,884 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2022-07-20 05:10:57,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:57,890 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2022-07-20 05:10:57,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1797 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1796 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_129 (_ BitVec 32))) (or (let ((.cse5 (store |c_#memory_$Pointer$.offset| v_~head~0.base_129 (store v_ArrVal_1797 (_ bv4 32) c_~head~0.offset))) (.cse2 (store |c_#memory_$Pointer$.base| v_~head~0.base_129 (store v_ArrVal_1796 (_ bv4 32) c_~head~0.base))) (.cse6 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse2 c_~head~0.base) .cse6)) (.cse4 (bvadd (_ bv4 32) (select (select .cse5 c_~head~0.base) .cse6)))) (let ((.cse0 (select (select .cse5 .cse3) .cse4))) (let ((.cse1 (bvadd (_ bv8 32) .cse0))) (and (bvule (bvadd (_ bv4 32) .cse0) .cse1) (bvule .cse1 (select (store |c_#length| v_~head~0.base_129 (_ bv8 32)) (select (select .cse2 .cse3) .cse4)))))))) (not (= (_ bv0 1) (bvneg (bvneg (select |c_#valid| v_~head~0.base_129))))))) is different from false [2022-07-20 05:10:57,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:10:57,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119475498] [2022-07-20 05:10:57,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119475498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:57,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1872188077] [2022-07-20 05:10:57,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:10:57,971 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:10:57,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:10:57,980 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:10:57,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-20 05:10:58,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:10:58,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:10:58,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-20 05:10:58,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:58,538 INFO L390 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 [2022-07-20 05:10:58,542 INFO L390 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 [2022-07-20 05:10:58,733 INFO L390 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 [2022-07-20 05:10:58,737 INFO L390 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 [2022-07-20 05:10:59,008 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 05:10:59,009 INFO L390 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 18 treesize of output 30 [2022-07-20 05:10:59,032 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:10:59,032 INFO L390 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 24 treesize of output 37 [2022-07-20 05:10:59,501 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:59,510 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:10:59,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:59,912 INFO L390 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 51 treesize of output 41 [2022-07-20 05:10:59,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:59,920 INFO L390 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 20 treesize of output 22 [2022-07-20 05:10:59,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:59,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2022-07-20 05:10:59,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:59,954 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-07-20 05:10:59,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 64 [2022-07-20 05:11:00,478 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:00,484 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:00,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,845 INFO L356 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2022-07-20 05:11:00,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 103 [2022-07-20 05:11:00,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,883 INFO L356 Elim1Store]: treesize reduction 4, result has 85.7 percent of original size [2022-07-20 05:11:00,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 47 [2022-07-20 05:11:00,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 54 [2022-07-20 05:11:00,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:00,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 58 [2022-07-20 05:11:02,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:02,589 INFO L356 Elim1Store]: treesize reduction 47, result has 25.4 percent of original size [2022-07-20 05:11:02,590 INFO L390 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 7 new quantified variables, introduced 6 case distinctions, treesize of input 235 treesize of output 107 [2022-07-20 05:11:02,605 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:11:02,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2022-07-20 05:11:02,900 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:11:02,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:11:03,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:03,243 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 80 [2022-07-20 05:11:03,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:03,250 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 68 [2022-07-20 05:11:03,271 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:03,272 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 80 [2022-07-20 05:11:03,290 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:03,290 INFO L390 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 71 [2022-07-20 05:11:03,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1924 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1925 (Array (_ BitVec 32) (_ BitVec 32))) (v_~head~0.base_135 (_ BitVec 32)) (v_ArrVal_1923 (_ BitVec 32))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| v_~head~0.base_135)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| v_~head~0.base_135 (store v_ArrVal_1924 (_ bv4 32) c_~head~0.offset))) (.cse1 (store |c_#memory_$Pointer$.base| v_~head~0.base_135 (store v_ArrVal_1925 (_ bv4 32) c_~head~0.base))) (.cse6 (bvadd c_~head~0.offset (_ bv4 32)))) (let ((.cse2 (select (select .cse1 c_~head~0.base) .cse6)) (.cse3 (bvadd (_ bv4 32) (select (select .cse5 c_~head~0.base) .cse6)))) (let ((.cse4 (select (select .cse5 .cse2) .cse3))) (let ((.cse0 (bvadd (_ bv8 32) .cse4))) (and (bvule .cse0 (select (store |c_#length| v_~head~0.base_135 v_ArrVal_1923) (select (select .cse1 .cse2) .cse3))) (bvule (bvadd (_ bv4 32) .cse4) .cse0)))))))) is different from false [2022-07-20 05:11:03,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1872188077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:11:03,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:11:03,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2022-07-20 05:11:03,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339881285] [2022-07-20 05:11:03,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:11:03,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-20 05:11:03,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:11:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-20 05:11:03,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2759, Unknown=39, NotChecked=214, Total=3192 [2022-07-20 05:11:03,406 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand has 47 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:11:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:11:08,997 INFO L93 Difference]: Finished difference Result 127 states and 149 transitions. [2022-07-20 05:11:08,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 05:11:08,997 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 49 [2022-07-20 05:11:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:11:08,998 INFO L225 Difference]: With dead ends: 127 [2022-07-20 05:11:08,998 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 05:11:09,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=406, Invalid=5213, Unknown=89, NotChecked=298, Total=6006 [2022-07-20 05:11:09,000 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 25 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 1363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 828 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:11:09,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 1226 Invalid, 1363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 513 Invalid, 0 Unknown, 828 Unchecked, 0.9s Time] [2022-07-20 05:11:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 05:11:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2022-07-20 05:11:09,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 109 states have internal predecessors, (130), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:11:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 138 transitions. [2022-07-20 05:11:09,004 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 138 transitions. Word has length 49 [2022-07-20 05:11:09,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:11:09,005 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 138 transitions. [2022-07-20 05:11:09,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 43 states have internal predecessors, (71), 6 states have call successors, (6), 3 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:11:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 138 transitions. [2022-07-20 05:11:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 05:11:09,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:11:09,006 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:11:09,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 05:11:09,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-20 05:11:09,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 05:11:09,416 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:11:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:11:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1277828622, now seen corresponding path program 1 times [2022-07-20 05:11:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:11:09,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480401489] [2022-07-20 05:11:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:11:09,417 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:11:09,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:11:09,418 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) [2022-07-20 05:11:09,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 05:11:09,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:11:09,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 05:11:09,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:11:09,654 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-20 05:11:09,655 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:11:09,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:11:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480401489] [2022-07-20 05:11:09,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480401489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:11:09,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:11:09,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:11:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545233586] [2022-07-20 05:11:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:11:09,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:11:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:11:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:11:09,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:11:09,657 INFO L87 Difference]: Start difference. First operand 116 states and 138 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:11:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:11:09,857 INFO L93 Difference]: Finished difference Result 201 states and 218 transitions. [2022-07-20 05:11:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:11:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-07-20 05:11:09,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:11:09,858 INFO L225 Difference]: With dead ends: 201 [2022-07-20 05:11:09,858 INFO L226 Difference]: Without dead ends: 201 [2022-07-20 05:11:09,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:11:09,859 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 208 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:11:09,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 325 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:11:09,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-20 05:11:09,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 116. [2022-07-20 05:11:09,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 109 states have internal predecessors, (129), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:11:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2022-07-20 05:11:09,863 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 52 [2022-07-20 05:11:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:11:09,863 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2022-07-20 05:11:09,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-20 05:11:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2022-07-20 05:11:09,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-20 05:11:09,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:11:09,864 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:11:09,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 05:11:10,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:11:10,064 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [insert_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, insert_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2022-07-20 05:11:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:11:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1727833039, now seen corresponding path program 4 times [2022-07-20 05:11:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:11:10,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632592364] [2022-07-20 05:11:10,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:11:10,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:11:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:11:10,067 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) [2022-07-20 05:11:10,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 05:11:10,420 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:11:10,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:11:10,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-20 05:11:10,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:11:10,467 INFO L390 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 [2022-07-20 05:11:10,485 INFO L390 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 [2022-07-20 05:11:10,499 INFO L390 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 [2022-07-20 05:11:10,690 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:10,699 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:10,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:10,873 INFO L390 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 24 treesize of output 26 [2022-07-20 05:11:10,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:10,881 INFO L390 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 26 treesize of output 28 [2022-07-20 05:11:10,905 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-07-20 05:11:10,905 INFO L390 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 24 treesize of output 37 [2022-07-20 05:11:11,073 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:11,087 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:11,189 INFO L356 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2022-07-20 05:11:11,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 122 [2022-07-20 05:11:11,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:11,210 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-07-20 05:11:11,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 91 [2022-07-20 05:11:11,231 INFO L356 Elim1Store]: treesize reduction 45, result has 42.3 percent of original size [2022-07-20 05:11:11,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 47 [2022-07-20 05:11:11,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 60 [2022-07-20 05:11:11,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 180 [2022-07-20 05:11:11,682 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:11,689 INFO L390 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 14 [2022-07-20 05:11:11,963 INFO L356 Elim1Store]: treesize reduction 64, result has 58.2 percent of original size [2022-07-20 05:11:11,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 282 treesize of output 287 [2022-07-20 05:11:11,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:11:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632592364] [2022-07-20 05:11:11,971 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-20 05:11:11,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-20 05:11:12,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:11:12,184 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-20 05:11:12,189 INFO L158 Benchmark]: Toolchain (without parser) took 56561.58ms. Allocated memory was 50.3MB in the beginning and 107.0MB in the end (delta: 56.6MB). Free memory was 25.6MB in the beginning and 34.6MB in the end (delta: -9.0MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2022-07-20 05:11:12,190 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 50.3MB. Free memory is still 32.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:11:12,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.86ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 25.4MB in the beginning and 40.2MB in the end (delta: -14.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-20 05:11:12,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.02ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 37.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-20 05:11:12,190 INFO L158 Benchmark]: Boogie Preprocessor took 56.50ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 35.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 05:11:12,191 INFO L158 Benchmark]: RCFGBuilder took 600.43ms. Allocated memory is still 60.8MB. Free memory was 35.6MB in the beginning and 35.1MB in the end (delta: 587.4kB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-07-20 05:11:12,191 INFO L158 Benchmark]: TraceAbstraction took 55204.02ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 34.4MB in the beginning and 34.6MB in the end (delta: -130.9kB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. [2022-07-20 05:11:12,192 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.19ms. Allocated memory is still 50.3MB. Free memory is still 32.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.86ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 25.4MB in the beginning and 40.2MB in the end (delta: -14.9MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.02ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 37.7MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.50ms. Allocated memory is still 60.8MB. Free memory was 37.7MB in the beginning and 35.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 600.43ms. Allocated memory is still 60.8MB. Free memory was 35.6MB in the beginning and 35.1MB in the end (delta: 587.4kB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 55204.02ms. Allocated memory was 60.8MB in the beginning and 107.0MB in the end (delta: 46.1MB). Free memory was 34.4MB in the beginning and 34.6MB in the end (delta: -130.9kB). Peak memory consumption was 47.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-20 05:11:12,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER