./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:39:28,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:39:28,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:39:28,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:39:28,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:39:28,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:39:28,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:39:28,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:39:28,281 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:39:28,282 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:39:28,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:39:28,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:39:28,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:39:28,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:39:28,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:39:28,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:39:28,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:39:28,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:39:28,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:39:28,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:39:28,306 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:39:28,306 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:39:28,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:39:28,307 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:39:28,308 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:39:28,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:39:28,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:39:28,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:39:28,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:39:28,313 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:39:28,314 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:39:28,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:39:28,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:39:28,315 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:39:28,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:39:28,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:39:28,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:39:28,317 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:39:28,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:39:28,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:39:28,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:39:28,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:39:28,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-13 01:39:28,339 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:39:28,340 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:39:28,340 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:39:28,340 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:39:28,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:39:28,341 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:39:28,341 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:39:28,341 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:39:28,341 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:39:28,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:39:28,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:39:28,342 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:39:28,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:39:28,343 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:39:28,344 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:39:28,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:39:28,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:39:28,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:39:28,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:39:28,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:39:28,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:39:28,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:39:28,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:39:28,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:39:28,345 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2022-07-13 01:39:28,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:39:28,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:39:28,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:39:28,528 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:39:28,528 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:39:28,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-07-13 01:39:28,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82aacbb9/2e0eea3065a94bc38124115a3edf5c77/FLAG43173ef69 [2022-07-13 01:39:29,022 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:39:29,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-07-13 01:39:29,038 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82aacbb9/2e0eea3065a94bc38124115a3edf5c77/FLAG43173ef69 [2022-07-13 01:39:29,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82aacbb9/2e0eea3065a94bc38124115a3edf5c77 [2022-07-13 01:39:29,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:39:29,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:39:29,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:39:29,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:39:29,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:39:29,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:39:29" (1/1) ... [2022-07-13 01:39:29,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34c82d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:29, skipping insertion in model container [2022-07-13 01:39:29,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:39:29" (1/1) ... [2022-07-13 01:39:29,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:39:29,096 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:39:29,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-07-13 01:39:29,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:39:29,605 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-13 01:39:29,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@72a67c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:29, skipping insertion in model container [2022-07-13 01:39:29,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:39:29,606 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:39:29,608 INFO L158 Benchmark]: Toolchain (without parser) took 555.13ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 60.1MB in the beginning and 73.5MB in the end (delta: -13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:39:29,608 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:39:29,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.54ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 59.9MB in the beginning and 73.5MB in the end (delta: -13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 01:39:29,610 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.15ms. Allocated memory is still 92.3MB. Free memory is still 47.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 553.54ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 59.9MB in the beginning and 73.5MB in the end (delta: -13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:39:31,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:39:31,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:39:31,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:39:31,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:39:31,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:39:31,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:39:31,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:39:31,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:39:31,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:39:31,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:39:31,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:39:31,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:39:31,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:39:31,099 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:39:31,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:39:31,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:39:31,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:39:31,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:39:31,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:39:31,109 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:39:31,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:39:31,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:39:31,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:39:31,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:39:31,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:39:31,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:39:31,119 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:39:31,119 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:39:31,120 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:39:31,120 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:39:31,121 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:39:31,121 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:39:31,122 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:39:31,123 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:39:31,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:39:31,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:39:31,124 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:39:31,125 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:39:31,125 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:39:31,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:39:31,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:39:31,128 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-13 01:39:31,150 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:39:31,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:39:31,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:39:31,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:39:31,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:39:31,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:39:31,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:39:31,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:39:31,152 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:39:31,153 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:39:31,153 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:39:31,153 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:39:31,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:39:31,154 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:39:31,155 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:39:31,155 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:39:31,155 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:39:31,155 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:39:31,155 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:39:31,155 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:39:31,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:39:31,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:39:31,156 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:39:31,156 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:39:31,156 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:39:31,156 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:39:31,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:39:31,157 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 22840dbbc7fdeff8c5ae44a2e4ee4ab6a60b4cab9f47ba8847305b912adb9a2c [2022-07-13 01:39:31,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:39:31,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:39:31,418 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:39:31,419 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:39:31,419 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:39:31,421 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-07-13 01:39:31,469 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961420bc8/8884cdcd5f844f43b3207fc40cbb227d/FLAG9613defe5 [2022-07-13 01:39:31,944 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:39:31,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i [2022-07-13 01:39:31,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961420bc8/8884cdcd5f844f43b3207fc40cbb227d/FLAG9613defe5 [2022-07-13 01:39:31,983 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/961420bc8/8884cdcd5f844f43b3207fc40cbb227d [2022-07-13 01:39:31,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:39:31,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:39:31,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:39:31,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:39:31,990 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:39:31,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:39:31" (1/1) ... [2022-07-13 01:39:31,992 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e0eaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:31, skipping insertion in model container [2022-07-13 01:39:31,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:39:31" (1/1) ... [2022-07-13 01:39:31,997 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:39:32,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:39:32,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-07-13 01:39:32,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:39:32,508 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:39:32,517 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:39:32,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-07-13 01:39:32,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:39:32,659 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:39:32,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test10-2.i[33022,33035] [2022-07-13 01:39:32,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:39:32,771 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:39:32,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32 WrapperNode [2022-07-13 01:39:32,771 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:39:32,772 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:39:32,772 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:39:32,773 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:39:32,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,823 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,903 INFO L137 Inliner]: procedures = 180, calls = 575, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2348 [2022-07-13 01:39:32,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:39:32,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:39:32,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:39:32,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:39:32,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:32,990 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:33,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:33,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:39:33,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:39:33,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:39:33,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:39:33,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (1/1) ... [2022-07-13 01:39:33,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:39:33,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:39:33,062 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-13 01:39:33,079 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-13 01:39:33,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:39:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-07-13 01:39:33,094 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-07-13 01:39:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:39:33,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 01:39:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 01:39:33,095 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 01:39:33,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:39:33,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:39:33,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:39:33,364 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:39:33,365 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:39:33,367 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 01:39:39,113 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:39:39,134 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:39:39,134 INFO L299 CfgBuilder]: Removed 160 assume(true) statements. [2022-07-13 01:39:39,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:39:39 BoogieIcfgContainer [2022-07-13 01:39:39,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:39:39,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:39:39,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:39:39,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:39:39,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:39:31" (1/3) ... [2022-07-13 01:39:39,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0f45b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:39:39, skipping insertion in model container [2022-07-13 01:39:39,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:39:32" (2/3) ... [2022-07-13 01:39:39,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c0f45b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:39:39, skipping insertion in model container [2022-07-13 01:39:39,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:39:39" (3/3) ... [2022-07-13 01:39:39,143 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test10-2.i [2022-07-13 01:39:39,152 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:39:39,152 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1095 error locations. [2022-07-13 01:39:39,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:39:39,199 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@69793f55, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f595fc7 [2022-07-13 01:39:39,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1095 error locations. [2022-07-13 01:39:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 2259 states, 1152 states have (on average 2.2144097222222223) internal successors, (2551), 2245 states have internal predecessors, (2551), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-13 01:39:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:39:39,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:39:39,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:39:39,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:39:39,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:39:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-07-13 01:39:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:39:39,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691110642] [2022-07-13 01:39:39,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:39:39,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:39:39,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:39:39,222 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-13 01:39:39,223 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-13 01:39:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:39:39,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:39:39,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:39:39,430 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-13 01:39:39,460 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-13 01:39:39,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:39:39,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:39:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691110642] [2022-07-13 01:39:39,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691110642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:39:39,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:39:39,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:39:39,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018676626] [2022-07-13 01:39:39,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:39:39,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:39:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:39:39,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:39:39,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:39:39,500 INFO L87 Difference]: Start difference. First operand has 2259 states, 1152 states have (on average 2.2144097222222223) internal successors, (2551), 2245 states have internal predecessors, (2551), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:39:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:39:42,102 INFO L93 Difference]: Finished difference Result 2934 states and 3120 transitions. [2022-07-13 01:39:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:39:42,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:39:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:39:42,124 INFO L225 Difference]: With dead ends: 2934 [2022-07-13 01:39:42,124 INFO L226 Difference]: Without dead ends: 2932 [2022-07-13 01:39:42,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:39:42,127 INFO L413 NwaCegarLoop]: 1394 mSDtfsCounter, 2142 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 1472 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:39:42,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 1869 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1472 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 01:39:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2022-07-13 01:39:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2401. [2022-07-13 01:39:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2401 states, 1318 states have (on average 2.0515933232169954) internal successors, (2704), 2385 states have internal predecessors, (2704), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 01:39:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2736 transitions. [2022-07-13 01:39:42,236 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2736 transitions. Word has length 3 [2022-07-13 01:39:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:39:42,237 INFO L495 AbstractCegarLoop]: Abstraction has 2401 states and 2736 transitions. [2022-07-13 01:39:42,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:39:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2736 transitions. [2022-07-13 01:39:42,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:39:42,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:39:42,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:39:42,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 01:39:42,444 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-13 01:39:42,444 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:39:42,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:39:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-07-13 01:39:42,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:39:42,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955698929] [2022-07-13 01:39:42,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:39:42,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:39:42,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:39:42,447 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-13 01:39:42,448 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-13 01:39:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:39:42,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:39:42,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:39:42,592 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-13 01:39:42,600 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-13 01:39:42,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:39:42,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:39:42,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955698929] [2022-07-13 01:39:42,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1955698929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:39:42,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:39:42,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:39:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348284160] [2022-07-13 01:39:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:39:42,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:39:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:39:42,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:39:42,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:39:42,603 INFO L87 Difference]: Start difference. First operand 2401 states and 2736 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:39:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:39:46,952 INFO L93 Difference]: Finished difference Result 3371 states and 3798 transitions. [2022-07-13 01:39:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:39:46,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:39:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:39:46,967 INFO L225 Difference]: With dead ends: 3371 [2022-07-13 01:39:46,967 INFO L226 Difference]: Without dead ends: 3371 [2022-07-13 01:39:46,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:39:46,968 INFO L413 NwaCegarLoop]: 1951 mSDtfsCounter, 1054 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:39:46,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 3245 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-13 01:39:46,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3371 states. [2022-07-13 01:39:47,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3371 to 2850. [2022-07-13 01:39:47,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2850 states, 1765 states have (on average 2.009631728045326) internal successors, (3547), 2831 states have internal predecessors, (3547), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 01:39:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2850 states to 2850 states and 3585 transitions. [2022-07-13 01:39:47,032 INFO L78 Accepts]: Start accepts. Automaton has 2850 states and 3585 transitions. Word has length 3 [2022-07-13 01:39:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:39:47,033 INFO L495 AbstractCegarLoop]: Abstraction has 2850 states and 3585 transitions. [2022-07-13 01:39:47,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:39:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2850 states and 3585 transitions. [2022-07-13 01:39:47,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 01:39:47,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:39:47,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:39:47,059 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-13 01:39:47,243 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-13 01:39:47,243 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:39:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:39:47,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-07-13 01:39:47,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:39:47,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486437388] [2022-07-13 01:39:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:39:47,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:39:47,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:39:47,246 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-13 01:39:47,248 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-13 01:39:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:39:47,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:39:47,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:39:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:39:47,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:39:47,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:39:47,552 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 12 treesize of output 14 [2022-07-13 01:39:47,562 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:39:47,563 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 12 treesize of output 12 [2022-07-13 01:39:47,585 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-13 01:39:47,586 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:39:47,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:39:47,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486437388] [2022-07-13 01:39:47,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486437388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:39:47,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:39:47,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:39:47,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860560274] [2022-07-13 01:39:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:39:47,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:39:47,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:39:47,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:39:47,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:39:47,589 INFO L87 Difference]: Start difference. First operand 2850 states and 3585 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:39:57,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:39:57,342 INFO L93 Difference]: Finished difference Result 5481 states and 6388 transitions. [2022-07-13 01:39:57,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:39:57,344 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-13 01:39:57,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:39:57,362 INFO L225 Difference]: With dead ends: 5481 [2022-07-13 01:39:57,362 INFO L226 Difference]: Without dead ends: 5481 [2022-07-13 01:39:57,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:39:57,363 INFO L413 NwaCegarLoop]: 847 mSDtfsCounter, 2765 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 4255 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 4283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:39:57,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 2890 Invalid, 4283 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [28 Valid, 4255 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-13 01:39:57,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5481 states. [2022-07-13 01:39:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5481 to 3569. [2022-07-13 01:39:57,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3569 states, 2484 states have (on average 2.0426731078904994) internal successors, (5074), 3544 states have internal predecessors, (5074), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:39:57,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3569 states to 3569 states and 5124 transitions. [2022-07-13 01:39:57,449 INFO L78 Accepts]: Start accepts. Automaton has 3569 states and 5124 transitions. Word has length 7 [2022-07-13 01:39:57,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:39:57,450 INFO L495 AbstractCegarLoop]: Abstraction has 3569 states and 5124 transitions. [2022-07-13 01:39:57,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:39:57,450 INFO L276 IsEmpty]: Start isEmpty. Operand 3569 states and 5124 transitions. [2022-07-13 01:39:57,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:39:57,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:39:57,451 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:39:57,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 01:39:57,660 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-13 01:39:57,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:39:57,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:39:57,662 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-07-13 01:39:57,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:39:57,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025168254] [2022-07-13 01:39:57,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:39:57,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:39:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:39:57,680 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-13 01:39:57,684 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-13 01:39:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:39:57,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:39:57,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:39:57,854 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-13 01:39:57,866 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-13 01:39:57,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:39:57,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:39:57,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025168254] [2022-07-13 01:39:57,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025168254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:39:57,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:39:57,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:39:57,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157962481] [2022-07-13 01:39:57,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:39:57,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:39:57,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:39:57,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:39:57,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:39:57,869 INFO L87 Difference]: Start difference. First operand 3569 states and 5124 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:01,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:01,087 INFO L93 Difference]: Finished difference Result 4773 states and 6641 transitions. [2022-07-13 01:40:01,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:01,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 01:40:01,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:01,104 INFO L225 Difference]: With dead ends: 4773 [2022-07-13 01:40:01,105 INFO L226 Difference]: Without dead ends: 4773 [2022-07-13 01:40:01,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 01:40:01,106 INFO L413 NwaCegarLoop]: 2177 mSDtfsCounter, 1998 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2933 SdHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:01,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 2933 Invalid, 1583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-13 01:40:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4773 states. [2022-07-13 01:40:01,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4773 to 3478. [2022-07-13 01:40:01,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 2484 states have (on average 1.9569243156199678) internal successors, (4861), 3453 states have internal predecessors, (4861), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4911 transitions. [2022-07-13 01:40:01,203 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4911 transitions. Word has length 8 [2022-07-13 01:40:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:01,204 INFO L495 AbstractCegarLoop]: Abstraction has 3478 states and 4911 transitions. [2022-07-13 01:40:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:01,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4911 transitions. [2022-07-13 01:40:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:40:01,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:01,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:01,215 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-13 01:40:01,411 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-13 01:40:01,412 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:01,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:01,413 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-07-13 01:40:01,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:01,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418387193] [2022-07-13 01:40:01,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:01,413 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:01,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:01,418 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-13 01:40:01,419 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-13 01:40:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:01,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:40:01,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:40:01,634 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-13 01:40:01,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:01,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:01,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418387193] [2022-07-13 01:40:01,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418387193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:01,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:01,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:40:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667402893] [2022-07-13 01:40:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:01,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:40:01,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:01,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:40:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:40:01,637 INFO L87 Difference]: Start difference. First operand 3478 states and 4911 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:06,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:06,663 INFO L93 Difference]: Finished difference Result 5193 states and 7269 transitions. [2022-07-13 01:40:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 01:40:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:06,677 INFO L225 Difference]: With dead ends: 5193 [2022-07-13 01:40:06,677 INFO L226 Difference]: Without dead ends: 5193 [2022-07-13 01:40:06,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 01:40:06,678 INFO L413 NwaCegarLoop]: 2557 mSDtfsCounter, 1369 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1578 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:06,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 3648 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1578 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 01:40:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5193 states. [2022-07-13 01:40:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5193 to 3800. [2022-07-13 01:40:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3800 states, 2816 states have (on average 1.9435369318181819) internal successors, (5473), 3775 states have internal predecessors, (5473), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3800 states to 3800 states and 5523 transitions. [2022-07-13 01:40:06,732 INFO L78 Accepts]: Start accepts. Automaton has 3800 states and 5523 transitions. Word has length 8 [2022-07-13 01:40:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:06,733 INFO L495 AbstractCegarLoop]: Abstraction has 3800 states and 5523 transitions. [2022-07-13 01:40:06,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 3800 states and 5523 transitions. [2022-07-13 01:40:06,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:40:06,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:06,734 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:06,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-13 01:40:06,942 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-13 01:40:06,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:06,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2022-07-13 01:40:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81968661] [2022-07-13 01:40:06,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:06,944 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:06,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:06,945 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-13 01:40:06,947 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-13 01:40:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:07,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:40:07,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:07,165 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-13 01:40:07,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:07,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:07,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81968661] [2022-07-13 01:40:07,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81968661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:07,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:07,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231672055] [2022-07-13 01:40:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:07,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:40:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:40:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:40:07,168 INFO L87 Difference]: Start difference. First operand 3800 states and 5523 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:07,201 INFO L93 Difference]: Finished difference Result 3740 states and 5437 transitions. [2022-07-13 01:40:07,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:07,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-13 01:40:07,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:07,216 INFO L225 Difference]: With dead ends: 3740 [2022-07-13 01:40:07,217 INFO L226 Difference]: Without dead ends: 3740 [2022-07-13 01:40:07,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-13 01:40:07,219 INFO L413 NwaCegarLoop]: 2221 mSDtfsCounter, 1011 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:07,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 3437 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2022-07-13 01:40:07,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2022-07-13 01:40:07,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2780 states have (on average 1.9377697841726618) internal successors, (5387), 3715 states have internal predecessors, (5387), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5437 transitions. [2022-07-13 01:40:07,267 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5437 transitions. Word has length 11 [2022-07-13 01:40:07,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:07,268 INFO L495 AbstractCegarLoop]: Abstraction has 3740 states and 5437 transitions. [2022-07-13 01:40:07,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5437 transitions. [2022-07-13 01:40:07,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:40:07,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:07,269 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:07,278 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-13 01:40:07,476 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-13 01:40:07,477 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:07,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:07,477 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2022-07-13 01:40:07,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:07,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27840060] [2022-07-13 01:40:07,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:07,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:07,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:07,480 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-13 01:40:07,481 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-13 01:40:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:07,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:07,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:07,652 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-13 01:40:07,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:07,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:07,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27840060] [2022-07-13 01:40:07,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27840060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:07,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:07,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:07,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780017825] [2022-07-13 01:40:07,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:07,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:07,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:07,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:07,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:07,673 INFO L87 Difference]: Start difference. First operand 3740 states and 5437 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:07,741 INFO L93 Difference]: Finished difference Result 3712 states and 5381 transitions. [2022-07-13 01:40:07,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:07,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-13 01:40:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:07,749 INFO L225 Difference]: With dead ends: 3712 [2022-07-13 01:40:07,749 INFO L226 Difference]: Without dead ends: 3712 [2022-07-13 01:40:07,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:07,750 INFO L413 NwaCegarLoop]: 2176 mSDtfsCounter, 982 mSDsluCounter, 3385 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 5561 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:07,751 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 5561 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:07,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2022-07-13 01:40:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3710. [2022-07-13 01:40:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3710 states, 2764 states have (on average 1.9280028943560057) internal successors, (5329), 3685 states have internal predecessors, (5329), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5379 transitions. [2022-07-13 01:40:07,794 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5379 transitions. Word has length 13 [2022-07-13 01:40:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:07,794 INFO L495 AbstractCegarLoop]: Abstraction has 3710 states and 5379 transitions. [2022-07-13 01:40:07,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5379 transitions. [2022-07-13 01:40:07,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:40:07,795 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:07,795 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:07,804 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-13 01:40:08,002 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-13 01:40:08,003 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:08,003 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-07-13 01:40:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:08,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369923370] [2022-07-13 01:40:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:08,004 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:08,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:08,005 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-13 01:40:08,007 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-13 01:40:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:08,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:40:08,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:08,188 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-13 01:40:08,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:08,188 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:08,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369923370] [2022-07-13 01:40:08,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369923370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:08,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:08,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:08,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388730590] [2022-07-13 01:40:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:08,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:40:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:40:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:40:08,190 INFO L87 Difference]: Start difference. First operand 3710 states and 5379 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:08,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:08,226 INFO L93 Difference]: Finished difference Result 5158 states and 6946 transitions. [2022-07-13 01:40:08,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:08,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 01:40:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:08,233 INFO L225 Difference]: With dead ends: 5158 [2022-07-13 01:40:08,234 INFO L226 Difference]: Without dead ends: 5158 [2022-07-13 01:40:08,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-13 01:40:08,234 INFO L413 NwaCegarLoop]: 3496 mSDtfsCounter, 2102 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 5112 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:08,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 5112 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:08,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5158 states. [2022-07-13 01:40:08,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5158 to 3650. [2022-07-13 01:40:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2728 states have (on average 1.9219208211143695) internal successors, (5243), 3625 states have internal predecessors, (5243), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:08,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 5293 transitions. [2022-07-13 01:40:08,279 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 5293 transitions. Word has length 20 [2022-07-13 01:40:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:08,279 INFO L495 AbstractCegarLoop]: Abstraction has 3650 states and 5293 transitions. [2022-07-13 01:40:08,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 5293 transitions. [2022-07-13 01:40:08,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:40:08,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:08,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:08,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:08,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:08,489 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:08,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:08,489 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2022-07-13 01:40:08,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:08,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391054605] [2022-07-13 01:40:08,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:08,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:08,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:08,491 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:08,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 01:40:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:08,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:40:08,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:08,683 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-13 01:40:08,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:08,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:08,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391054605] [2022-07-13 01:40:08,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391054605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:08,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:08,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452067373] [2022-07-13 01:40:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:08,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:40:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:08,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:40:08,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:40:08,686 INFO L87 Difference]: Start difference. First operand 3650 states and 5293 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:08,742 INFO L93 Difference]: Finished difference Result 4991 states and 6655 transitions. [2022-07-13 01:40:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 01:40:08,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:08,753 INFO L225 Difference]: With dead ends: 4991 [2022-07-13 01:40:08,753 INFO L226 Difference]: Without dead ends: 4991 [2022-07-13 01:40:08,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-13 01:40:08,755 INFO L413 NwaCegarLoop]: 3628 mSDtfsCounter, 2059 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 5196 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:08,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 5196 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:08,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2022-07-13 01:40:08,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 3518. [2022-07-13 01:40:08,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3518 states, 2620 states have (on average 1.9026717557251909) internal successors, (4985), 3493 states have internal predecessors, (4985), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:08,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3518 states to 3518 states and 5035 transitions. [2022-07-13 01:40:08,814 INFO L78 Accepts]: Start accepts. Automaton has 3518 states and 5035 transitions. Word has length 20 [2022-07-13 01:40:08,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:08,814 INFO L495 AbstractCegarLoop]: Abstraction has 3518 states and 5035 transitions. [2022-07-13 01:40:08,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:08,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3518 states and 5035 transitions. [2022-07-13 01:40:08,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:40:08,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:08,817 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:08,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:09,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:09,026 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-07-13 01:40:09,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:09,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [404113521] [2022-07-13 01:40:09,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:09,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:09,029 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-13 01:40:09,042 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-13 01:40:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:09,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:09,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:09,265 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-13 01:40:09,266 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:09,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:09,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [404113521] [2022-07-13 01:40:09,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [404113521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:09,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:09,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:09,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222581536] [2022-07-13 01:40:09,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:09,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:09,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:09,267 INFO L87 Difference]: Start difference. First operand 3518 states and 5035 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:09,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:09,350 INFO L93 Difference]: Finished difference Result 4956 states and 6589 transitions. [2022-07-13 01:40:09,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:09,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 01:40:09,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:09,359 INFO L225 Difference]: With dead ends: 4956 [2022-07-13 01:40:09,359 INFO L226 Difference]: Without dead ends: 4956 [2022-07-13 01:40:09,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:09,360 INFO L413 NwaCegarLoop]: 3588 mSDtfsCounter, 2030 mSDsluCounter, 5154 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2040 SdHoareTripleChecker+Valid, 8742 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:09,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2040 Valid, 8742 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:09,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4956 states. [2022-07-13 01:40:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4956 to 3488. [2022-07-13 01:40:09,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3488 states, 2604 states have (on average 1.892089093701997) internal successors, (4927), 3463 states have internal predecessors, (4927), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:09,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4977 transitions. [2022-07-13 01:40:09,416 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4977 transitions. Word has length 22 [2022-07-13 01:40:09,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:09,416 INFO L495 AbstractCegarLoop]: Abstraction has 3488 states and 4977 transitions. [2022-07-13 01:40:09,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:09,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4977 transitions. [2022-07-13 01:40:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:40:09,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:09,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:09,428 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-13 01:40:09,627 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-13 01:40:09,628 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:09,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2022-07-13 01:40:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:09,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643370259] [2022-07-13 01:40:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:09,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:09,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:09,631 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-13 01:40:09,632 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-13 01:40:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:09,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:09,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:09,845 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-13 01:40:09,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:09,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:09,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [643370259] [2022-07-13 01:40:09,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [643370259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:09,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:09,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939449689] [2022-07-13 01:40:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:09,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:09,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:09,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:09,848 INFO L87 Difference]: Start difference. First operand 3488 states and 4977 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:09,940 INFO L93 Difference]: Finished difference Result 4883 states and 6400 transitions. [2022-07-13 01:40:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:09,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 01:40:09,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:09,948 INFO L225 Difference]: With dead ends: 4883 [2022-07-13 01:40:09,949 INFO L226 Difference]: Without dead ends: 4883 [2022-07-13 01:40:09,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:09,949 INFO L413 NwaCegarLoop]: 3513 mSDtfsCounter, 1995 mSDsluCounter, 5039 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 8552 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:09,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 8552 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:40:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2022-07-13 01:40:09,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 3426. [2022-07-13 01:40:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3426 states, 2556 states have (on average 1.859546165884194) internal successors, (4753), 3401 states have internal predecessors, (4753), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:09,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3426 states to 3426 states and 4803 transitions. [2022-07-13 01:40:09,993 INFO L78 Accepts]: Start accepts. Automaton has 3426 states and 4803 transitions. Word has length 22 [2022-07-13 01:40:09,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:09,993 INFO L495 AbstractCegarLoop]: Abstraction has 3426 states and 4803 transitions. [2022-07-13 01:40:09,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3426 states and 4803 transitions. [2022-07-13 01:40:09,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:40:09,994 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:09,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:10,007 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-13 01:40:10,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:10,203 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:10,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2022-07-13 01:40:10,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:10,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1551453286] [2022-07-13 01:40:10,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:10,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:10,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:10,205 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:10,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 01:40:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:10,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:40:10,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:10,379 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-13 01:40:10,411 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-13 01:40:10,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:10,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:10,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1551453286] [2022-07-13 01:40:10,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1551453286] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:10,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:10,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:10,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727404095] [2022-07-13 01:40:10,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:10,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:10,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:10,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:10,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:10,413 INFO L87 Difference]: Start difference. First operand 3426 states and 4803 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:13,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:13,385 INFO L93 Difference]: Finished difference Result 3878 states and 5162 transitions. [2022-07-13 01:40:13,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:13,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 01:40:13,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:13,394 INFO L225 Difference]: With dead ends: 3878 [2022-07-13 01:40:13,394 INFO L226 Difference]: Without dead ends: 3878 [2022-07-13 01:40:13,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:13,400 INFO L413 NwaCegarLoop]: 1244 mSDtfsCounter, 2745 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1796 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2751 SdHoareTripleChecker+Valid, 2342 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:13,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2751 Valid, 2342 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1796 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-13 01:40:13,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2022-07-13 01:40:13,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3422. [2022-07-13 01:40:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3422 states, 2556 states have (on average 1.85641627543036) internal successors, (4745), 3397 states have internal predecessors, (4745), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3422 states to 3422 states and 4795 transitions. [2022-07-13 01:40:13,438 INFO L78 Accepts]: Start accepts. Automaton has 3422 states and 4795 transitions. Word has length 27 [2022-07-13 01:40:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:13,438 INFO L495 AbstractCegarLoop]: Abstraction has 3422 states and 4795 transitions. [2022-07-13 01:40:13,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 3422 states and 4795 transitions. [2022-07-13 01:40:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:40:13,439 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:13,439 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:13,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:13,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:13,647 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:13,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:13,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2022-07-13 01:40:13,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:13,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296728647] [2022-07-13 01:40:13,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:13,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:13,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:13,649 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-13 01:40:13,651 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-13 01:40:13,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:13,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:40:13,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:13,827 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-13 01:40:13,921 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-13 01:40:13,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:13,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296728647] [2022-07-13 01:40:13,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [296728647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:13,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:13,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:13,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485543858] [2022-07-13 01:40:13,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:13,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:13,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:13,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:13,924 INFO L87 Difference]: Start difference. First operand 3422 states and 4795 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:19,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:19,526 INFO L93 Difference]: Finished difference Result 4323 states and 5779 transitions. [2022-07-13 01:40:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:40:19,527 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-13 01:40:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:19,534 INFO L225 Difference]: With dead ends: 4323 [2022-07-13 01:40:19,534 INFO L226 Difference]: Without dead ends: 4323 [2022-07-13 01:40:19,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:19,535 INFO L413 NwaCegarLoop]: 1654 mSDtfsCounter, 1907 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 2299 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 3817 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:19,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 3817 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2299 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-13 01:40:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4323 states. [2022-07-13 01:40:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4323 to 3458. [2022-07-13 01:40:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3458 states, 2592 states have (on average 1.8464506172839505) internal successors, (4786), 3433 states have internal predecessors, (4786), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4836 transitions. [2022-07-13 01:40:19,593 INFO L78 Accepts]: Start accepts. Automaton has 3458 states and 4836 transitions. Word has length 27 [2022-07-13 01:40:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:19,593 INFO L495 AbstractCegarLoop]: Abstraction has 3458 states and 4836 transitions. [2022-07-13 01:40:19,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 3458 states and 4836 transitions. [2022-07-13 01:40:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:40:19,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:19,596 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:19,614 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-13 01:40:19,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:19,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-07-13 01:40:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:19,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200287343] [2022-07-13 01:40:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:19,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:19,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:19,807 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:19,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-13 01:40:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:20,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:40:20,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:20,037 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-13 01:40:20,085 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-13 01:40:20,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:20,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:20,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200287343] [2022-07-13 01:40:20,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200287343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:20,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:20,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:20,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114417057] [2022-07-13 01:40:20,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:20,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:20,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:20,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:20,087 INFO L87 Difference]: Start difference. First operand 3458 states and 4836 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:25,209 INFO L93 Difference]: Finished difference Result 6686 states and 9193 transitions. [2022-07-13 01:40:25,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:40:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-13 01:40:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:25,223 INFO L225 Difference]: With dead ends: 6686 [2022-07-13 01:40:25,223 INFO L226 Difference]: Without dead ends: 6686 [2022-07-13 01:40:25,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:25,224 INFO L413 NwaCegarLoop]: 2703 mSDtfsCounter, 3693 mSDsluCounter, 2136 mSDsCounter, 0 mSdLazyCounter, 2953 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3700 SdHoareTripleChecker+Valid, 4839 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:25,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3700 Valid, 4839 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2953 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-13 01:40:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2022-07-13 01:40:25,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 3454. [2022-07-13 01:40:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3454 states, 2592 states have (on average 1.8433641975308641) internal successors, (4778), 3429 states have internal predecessors, (4778), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3454 states to 3454 states and 4828 transitions. [2022-07-13 01:40:25,302 INFO L78 Accepts]: Start accepts. Automaton has 3454 states and 4828 transitions. Word has length 36 [2022-07-13 01:40:25,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:25,302 INFO L495 AbstractCegarLoop]: Abstraction has 3454 states and 4828 transitions. [2022-07-13 01:40:25,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:25,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3454 states and 4828 transitions. [2022-07-13 01:40:25,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:40:25,304 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:25,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:25,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:25,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:25,516 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:25,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-07-13 01:40:25,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:25,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066323797] [2022-07-13 01:40:25,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:25,519 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:25,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:25,525 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-13 01:40:25,527 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-13 01:40:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:25,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:40:25,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:25,768 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-13 01:40:25,941 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-13 01:40:25,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:25,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:25,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066323797] [2022-07-13 01:40:25,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066323797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:25,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:25,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:25,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435011957] [2022-07-13 01:40:25,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:25,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:25,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:25,942 INFO L87 Difference]: Start difference. First operand 3454 states and 4828 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:32,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:32,482 INFO L93 Difference]: Finished difference Result 6369 states and 8585 transitions. [2022-07-13 01:40:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:40:32,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-13 01:40:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:32,495 INFO L225 Difference]: With dead ends: 6369 [2022-07-13 01:40:32,495 INFO L226 Difference]: Without dead ends: 6369 [2022-07-13 01:40:32,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:32,496 INFO L413 NwaCegarLoop]: 2653 mSDtfsCounter, 3063 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 2951 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3067 SdHoareTripleChecker+Valid, 5267 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:32,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3067 Valid, 5267 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2951 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-13 01:40:32,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6369 states. [2022-07-13 01:40:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6369 to 3450. [2022-07-13 01:40:32,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 2592 states have (on average 1.8402777777777777) internal successors, (4770), 3425 states have internal predecessors, (4770), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 4820 transitions. [2022-07-13 01:40:32,559 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 4820 transitions. Word has length 36 [2022-07-13 01:40:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:32,559 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 4820 transitions. [2022-07-13 01:40:32,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 4820 transitions. [2022-07-13 01:40:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:40:32,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:32,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:32,598 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-13 01:40:32,769 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-13 01:40:32,769 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:32,770 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2022-07-13 01:40:32,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:32,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [22976101] [2022-07-13 01:40:32,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:32,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:32,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:32,776 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-13 01:40:32,778 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-13 01:40:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:32,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:40:32,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:32,996 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-13 01:40:33,037 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-13 01:40:33,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:33,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:33,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [22976101] [2022-07-13 01:40:33,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [22976101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:33,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:33,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:33,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306758485] [2022-07-13 01:40:33,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:33,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:33,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:33,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:33,039 INFO L87 Difference]: Start difference. First operand 3450 states and 4820 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:37,566 INFO L93 Difference]: Finished difference Result 7130 states and 9705 transitions. [2022-07-13 01:40:37,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:40:37,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-13 01:40:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:37,574 INFO L225 Difference]: With dead ends: 7130 [2022-07-13 01:40:37,575 INFO L226 Difference]: Without dead ends: 7130 [2022-07-13 01:40:37,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:37,575 INFO L413 NwaCegarLoop]: 2271 mSDtfsCounter, 4685 mSDsluCounter, 2326 mSDsCounter, 0 mSdLazyCounter, 2965 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4695 SdHoareTripleChecker+Valid, 4597 SdHoareTripleChecker+Invalid, 3016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:37,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4695 Valid, 4597 Invalid, 3016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2965 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-13 01:40:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2022-07-13 01:40:37,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 3447. [2022-07-13 01:40:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2592 states have (on average 1.8317901234567902) internal successors, (4748), 3422 states have internal predecessors, (4748), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4798 transitions. [2022-07-13 01:40:37,627 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4798 transitions. Word has length 36 [2022-07-13 01:40:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:37,627 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 4798 transitions. [2022-07-13 01:40:37,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4798 transitions. [2022-07-13 01:40:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:40:37,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:37,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:37,643 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-13 01:40:37,841 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-13 01:40:37,841 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:37,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:37,842 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2022-07-13 01:40:37,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:37,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701171679] [2022-07-13 01:40:37,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:37,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:37,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:37,844 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-13 01:40:37,845 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-13 01:40:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:38,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:40:38,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:38,021 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-13 01:40:38,152 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-13 01:40:38,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:38,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:38,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701171679] [2022-07-13 01:40:38,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701171679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:38,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:38,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048515208] [2022-07-13 01:40:38,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:38,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:38,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:38,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:38,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:38,153 INFO L87 Difference]: Start difference. First operand 3447 states and 4798 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:43,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:43,109 INFO L93 Difference]: Finished difference Result 5205 states and 6971 transitions. [2022-07-13 01:40:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:40:43,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-13 01:40:43,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:43,115 INFO L225 Difference]: With dead ends: 5205 [2022-07-13 01:40:43,116 INFO L226 Difference]: Without dead ends: 5205 [2022-07-13 01:40:43,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:43,116 INFO L413 NwaCegarLoop]: 2560 mSDtfsCounter, 2416 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 4747 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:43,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 4747 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 01:40:43,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2022-07-13 01:40:43,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 3447. [2022-07-13 01:40:43,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 2592 states have (on average 1.8287037037037037) internal successors, (4740), 3422 states have internal predecessors, (4740), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:43,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 4790 transitions. [2022-07-13 01:40:43,178 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 4790 transitions. Word has length 36 [2022-07-13 01:40:43,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:43,178 INFO L495 AbstractCegarLoop]: Abstraction has 3447 states and 4790 transitions. [2022-07-13 01:40:43,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:43,179 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 4790 transitions. [2022-07-13 01:40:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 01:40:43,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:43,179 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:43,203 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-13 01:40:43,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:43,391 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:43,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2022-07-13 01:40:43,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:43,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81210012] [2022-07-13 01:40:43,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:43,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:43,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:43,408 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:43,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-13 01:40:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:43,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:43,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:43,703 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-13 01:40:43,703 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:43,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:43,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81210012] [2022-07-13 01:40:43,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81210012] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:43,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:43,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:43,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29676076] [2022-07-13 01:40:43,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:43,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:43,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:43,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:43,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:43,707 INFO L87 Difference]: Start difference. First operand 3447 states and 4790 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:43,754 INFO L93 Difference]: Finished difference Result 3435 states and 4766 transitions. [2022-07-13 01:40:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:43,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-13 01:40:43,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:43,758 INFO L225 Difference]: With dead ends: 3435 [2022-07-13 01:40:43,758 INFO L226 Difference]: Without dead ends: 3435 [2022-07-13 01:40:43,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:43,759 INFO L413 NwaCegarLoop]: 2007 mSDtfsCounter, 966 mSDsluCounter, 3035 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 5042 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:43,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 5042 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:43,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2022-07-13 01:40:43,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3435. [2022-07-13 01:40:43,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3435 states, 2580 states have (on average 1.827906976744186) internal successors, (4716), 3410 states have internal predecessors, (4716), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:40:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 4766 transitions. [2022-07-13 01:40:43,823 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 4766 transitions. Word has length 40 [2022-07-13 01:40:43,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:43,823 INFO L495 AbstractCegarLoop]: Abstraction has 3435 states and 4766 transitions. [2022-07-13 01:40:43,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 4766 transitions. [2022-07-13 01:40:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 01:40:43,824 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:43,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:43,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:44,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:44,025 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:44,025 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2022-07-13 01:40:44,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:44,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078178059] [2022-07-13 01:40:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:44,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:44,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:44,028 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-13 01:40:44,047 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-13 01:40:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:44,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:44,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:44,369 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-13 01:40:44,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:44,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:44,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078178059] [2022-07-13 01:40:44,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078178059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:44,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:44,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617654957] [2022-07-13 01:40:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:44,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:40:44,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:44,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:40:44,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:40:44,371 INFO L87 Difference]: Start difference. First operand 3435 states and 4766 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:44,590 INFO L93 Difference]: Finished difference Result 5077 states and 6789 transitions. [2022-07-13 01:40:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:44,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-07-13 01:40:44,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:44,596 INFO L225 Difference]: With dead ends: 5077 [2022-07-13 01:40:44,596 INFO L226 Difference]: Without dead ends: 5077 [2022-07-13 01:40:44,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-13 01:40:44,596 INFO L413 NwaCegarLoop]: 2098 mSDtfsCounter, 1382 mSDsluCounter, 1854 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1391 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:44,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1391 Valid, 3952 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 01:40:44,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2022-07-13 01:40:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4452. [2022-07-13 01:40:44,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4452 states, 3590 states have (on average 1.8147632311977715) internal successors, (6515), 4417 states have internal predecessors, (6515), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:40:44,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4452 states to 4452 states and 6585 transitions. [2022-07-13 01:40:44,637 INFO L78 Accepts]: Start accepts. Automaton has 4452 states and 6585 transitions. Word has length 48 [2022-07-13 01:40:44,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:44,637 INFO L495 AbstractCegarLoop]: Abstraction has 4452 states and 6585 transitions. [2022-07-13 01:40:44,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 4452 states and 6585 transitions. [2022-07-13 01:40:44,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 01:40:44,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:44,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:44,655 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-13 01:40:44,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:44,847 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:44,847 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2022-07-13 01:40:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:44,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622670348] [2022-07-13 01:40:44,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:44,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:44,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:44,849 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:44,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 01:40:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:45,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:45,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:45,168 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-13 01:40:45,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:45,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:45,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622670348] [2022-07-13 01:40:45,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622670348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:45,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:45,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:45,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254968650] [2022-07-13 01:40:45,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:45,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:45,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:45,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:45,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:45,170 INFO L87 Difference]: Start difference. First operand 4452 states and 6585 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:45,233 INFO L93 Difference]: Finished difference Result 5586 states and 7773 transitions. [2022-07-13 01:40:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-13 01:40:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:45,241 INFO L225 Difference]: With dead ends: 5586 [2022-07-13 01:40:45,241 INFO L226 Difference]: Without dead ends: 5586 [2022-07-13 01:40:45,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:45,242 INFO L413 NwaCegarLoop]: 3060 mSDtfsCounter, 1965 mSDsluCounter, 4357 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1975 SdHoareTripleChecker+Valid, 7417 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:45,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1975 Valid, 7417 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:45,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2022-07-13 01:40:45,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 4410. [2022-07-13 01:40:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4410 states, 3548 states have (on average 1.8165163472378805) internal successors, (6445), 4375 states have internal predecessors, (6445), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:40:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4410 states to 4410 states and 6515 transitions. [2022-07-13 01:40:45,294 INFO L78 Accepts]: Start accepts. Automaton has 4410 states and 6515 transitions. Word has length 51 [2022-07-13 01:40:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:45,295 INFO L495 AbstractCegarLoop]: Abstraction has 4410 states and 6515 transitions. [2022-07-13 01:40:45,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4410 states and 6515 transitions. [2022-07-13 01:40:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 01:40:45,296 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:45,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:45,320 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-13 01:40:45,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:45,508 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:45,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:45,508 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-07-13 01:40:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:45,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473587075] [2022-07-13 01:40:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:45,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:45,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:45,510 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-13 01:40:45,512 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-13 01:40:45,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:45,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:45,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:45,778 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-13 01:40:45,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:45,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:45,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473587075] [2022-07-13 01:40:45,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473587075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:45,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:45,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:45,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245559157] [2022-07-13 01:40:45,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:45,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:45,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:45,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:45,781 INFO L87 Difference]: Start difference. First operand 4410 states and 6515 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:45,844 INFO L93 Difference]: Finished difference Result 5322 states and 7259 transitions. [2022-07-13 01:40:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:45,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-13 01:40:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:45,851 INFO L225 Difference]: With dead ends: 5322 [2022-07-13 01:40:45,851 INFO L226 Difference]: Without dead ends: 5322 [2022-07-13 01:40:45,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:45,852 INFO L413 NwaCegarLoop]: 3322 mSDtfsCounter, 1956 mSDsluCounter, 4668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1966 SdHoareTripleChecker+Valid, 7990 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:45,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1966 Valid, 7990 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:40:45,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2022-07-13 01:40:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 4392. [2022-07-13 01:40:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4392 states, 3530 states have (on average 1.8172804532577904) internal successors, (6415), 4357 states have internal predecessors, (6415), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:40:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4392 states to 4392 states and 6485 transitions. [2022-07-13 01:40:45,907 INFO L78 Accepts]: Start accepts. Automaton has 4392 states and 6485 transitions. Word has length 54 [2022-07-13 01:40:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:45,908 INFO L495 AbstractCegarLoop]: Abstraction has 4392 states and 6485 transitions. [2022-07-13 01:40:45,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:45,908 INFO L276 IsEmpty]: Start isEmpty. Operand 4392 states and 6485 transitions. [2022-07-13 01:40:45,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:40:45,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:45,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:45,918 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-13 01:40:46,117 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-13 01:40:46,118 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:46,119 INFO L85 PathProgramCache]: Analyzing trace with hash -665468730, now seen corresponding path program 1 times [2022-07-13 01:40:46,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:46,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672626500] [2022-07-13 01:40:46,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:46,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:46,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:46,121 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-13 01:40:46,122 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-13 01:40:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:46,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:40:46,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:46,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:40:46,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:40:46,413 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-13 01:40:46,413 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 3 case distinctions, treesize of input 29 treesize of output 36 [2022-07-13 01:40:46,439 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-13 01:40:46,440 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-13 01:40:46,462 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-13 01:40:46,462 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:46,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:46,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672626500] [2022-07-13 01:40:46,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [672626500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:46,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:46,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:46,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447674151] [2022-07-13 01:40:46,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:46,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:46,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:46,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:46,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:46,463 INFO L87 Difference]: Start difference. First operand 4392 states and 6485 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:47,893 INFO L93 Difference]: Finished difference Result 4496 states and 6595 transitions. [2022-07-13 01:40:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:47,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-13 01:40:47,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:47,902 INFO L225 Difference]: With dead ends: 4496 [2022-07-13 01:40:47,902 INFO L226 Difference]: Without dead ends: 4496 [2022-07-13 01:40:47,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:47,903 INFO L413 NwaCegarLoop]: 1895 mSDtfsCounter, 907 mSDsluCounter, 2951 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 4846 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:47,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 4846 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 122 Unchecked, 1.4s Time] [2022-07-13 01:40:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4496 states. [2022-07-13 01:40:47,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4496 to 4358. [2022-07-13 01:40:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4358 states, 3496 states have (on average 1.8249427917620138) internal successors, (6380), 4323 states have internal predecessors, (6380), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2022-07-13 01:40:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4358 states to 4358 states and 6450 transitions. [2022-07-13 01:40:47,963 INFO L78 Accepts]: Start accepts. Automaton has 4358 states and 6450 transitions. Word has length 57 [2022-07-13 01:40:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:47,963 INFO L495 AbstractCegarLoop]: Abstraction has 4358 states and 6450 transitions. [2022-07-13 01:40:47,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:47,964 INFO L276 IsEmpty]: Start isEmpty. Operand 4358 states and 6450 transitions. [2022-07-13 01:40:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:40:47,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:47,964 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:47,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:48,173 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-13 01:40:48,174 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:48,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:48,175 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2022-07-13 01:40:48,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:48,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730257951] [2022-07-13 01:40:48,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:48,175 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:48,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:48,177 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:48,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-13 01:40:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:48,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:40:48,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:48,564 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-13 01:40:48,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:48,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:48,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730257951] [2022-07-13 01:40:48,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730257951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:48,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:48,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:48,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930192907] [2022-07-13 01:40:48,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:48,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:40:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:48,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:40:48,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:40:48,566 INFO L87 Difference]: Start difference. First operand 4358 states and 6450 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:48,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:48,686 INFO L93 Difference]: Finished difference Result 5982 states and 8540 transitions. [2022-07-13 01:40:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:40:48,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-07-13 01:40:48,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:48,693 INFO L225 Difference]: With dead ends: 5982 [2022-07-13 01:40:48,693 INFO L226 Difference]: Without dead ends: 5982 [2022-07-13 01:40:48,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-13 01:40:48,696 INFO L413 NwaCegarLoop]: 2433 mSDtfsCounter, 1079 mSDsluCounter, 1882 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:48,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 4315 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:40:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5982 states. [2022-07-13 01:40:48,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5982 to 5431. [2022-07-13 01:40:48,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5431 states, 4561 states have (on average 1.8013593510195132) internal successors, (8216), 5385 states have internal predecessors, (8216), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:40:48,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5431 states to 5431 states and 8308 transitions. [2022-07-13 01:40:48,774 INFO L78 Accepts]: Start accepts. Automaton has 5431 states and 8308 transitions. Word has length 59 [2022-07-13 01:40:48,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:48,774 INFO L495 AbstractCegarLoop]: Abstraction has 5431 states and 8308 transitions. [2022-07-13 01:40:48,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:48,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5431 states and 8308 transitions. [2022-07-13 01:40:48,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:40:48,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:48,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:48,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:48,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:48,985 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:48,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:48,985 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-07-13 01:40:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:48,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100531723] [2022-07-13 01:40:48,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:48,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:48,987 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:48,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-13 01:40:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:49,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:40:49,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:49,396 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-13 01:40:49,400 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-13 01:40:49,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:40:49,697 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 12 treesize of output 14 [2022-07-13 01:40:49,709 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:40:49,709 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 11 treesize of output 11 [2022-07-13 01:40:49,719 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-13 01:40:49,719 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:49,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:49,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100531723] [2022-07-13 01:40:49,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100531723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:49,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:49,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:40:49,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875095692] [2022-07-13 01:40:49,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:49,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:40:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:49,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:40:49,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:49,720 INFO L87 Difference]: Start difference. First operand 5431 states and 8308 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:53,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:53,694 INFO L93 Difference]: Finished difference Result 7850 states and 12031 transitions. [2022-07-13 01:40:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:40:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-13 01:40:53,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:53,704 INFO L225 Difference]: With dead ends: 7850 [2022-07-13 01:40:53,704 INFO L226 Difference]: Without dead ends: 7850 [2022-07-13 01:40:53,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:40:53,705 INFO L413 NwaCegarLoop]: 853 mSDtfsCounter, 4067 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4081 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:53,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4081 Valid, 1363 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-13 01:40:53,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7850 states. [2022-07-13 01:40:53,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7850 to 5191. [2022-07-13 01:40:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5191 states, 4405 states have (on average 1.7332576617480135) internal successors, (7635), 5145 states have internal predecessors, (7635), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:40:53,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 7727 transitions. [2022-07-13 01:40:53,770 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 7727 transitions. Word has length 62 [2022-07-13 01:40:53,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:53,771 INFO L495 AbstractCegarLoop]: Abstraction has 5191 states and 7727 transitions. [2022-07-13 01:40:53,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:53,771 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 7727 transitions. [2022-07-13 01:40:53,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:40:53,772 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:53,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:53,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-13 01:40:53,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:53,987 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:53,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-07-13 01:40:53,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:53,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017616949] [2022-07-13 01:40:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:53,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:53,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:54,001 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:54,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-13 01:40:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:54,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:40:54,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:54,326 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-13 01:40:54,334 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-13 01:40:54,350 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 21 treesize of output 9 [2022-07-13 01:40:54,356 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-13 01:40:54,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:54,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:54,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017616949] [2022-07-13 01:40:54,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017616949] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:54,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:54,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42768471] [2022-07-13 01:40:54,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:54,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:40:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:40:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:54,359 INFO L87 Difference]: Start difference. First operand 5191 states and 7727 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:40:57,977 INFO L93 Difference]: Finished difference Result 5190 states and 7724 transitions. [2022-07-13 01:40:57,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:40:57,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-13 01:40:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:40:57,983 INFO L225 Difference]: With dead ends: 5190 [2022-07-13 01:40:57,983 INFO L226 Difference]: Without dead ends: 5190 [2022-07-13 01:40:57,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:40:57,984 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 4 mSDsluCounter, 3188 mSDsCounter, 0 mSdLazyCounter, 2595 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5114 SdHoareTripleChecker+Invalid, 2596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:40:57,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5114 Invalid, 2596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2595 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-13 01:40:57,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-07-13 01:40:58,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-07-13 01:40:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4405 states have (on average 1.7325766174801362) internal successors, (7632), 5144 states have internal predecessors, (7632), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:40:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7724 transitions. [2022-07-13 01:40:58,031 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7724 transitions. Word has length 67 [2022-07-13 01:40:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:40:58,032 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7724 transitions. [2022-07-13 01:40:58,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:40:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7724 transitions. [2022-07-13 01:40:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:40:58,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:40:58,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:40:58,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-13 01:40:58,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:40:58,246 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:40:58,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:40:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-07-13 01:40:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:40:58,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096144416] [2022-07-13 01:40:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:40:58,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:40:58,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:40:58,248 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:40:58,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-13 01:40:58,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:40:58,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:40:58,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:40:58,549 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-13 01:40:58,563 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-13 01:40:58,570 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-13 01:40:58,598 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 21 treesize of output 9 [2022-07-13 01:40:58,601 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 7 [2022-07-13 01:40:58,612 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-13 01:40:58,612 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:40:58,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:40:58,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096144416] [2022-07-13 01:40:58,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096144416] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:40:58,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:40:58,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:40:58,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131723863] [2022-07-13 01:40:58,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:40:58,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:40:58,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:40:58,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:40:58,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:40:58,615 INFO L87 Difference]: Start difference. First operand 5190 states and 7724 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:41:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:03,631 INFO L93 Difference]: Finished difference Result 5189 states and 7721 transitions. [2022-07-13 01:41:03,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:41:03,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-13 01:41:03,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:03,638 INFO L225 Difference]: With dead ends: 5189 [2022-07-13 01:41:03,638 INFO L226 Difference]: Without dead ends: 5189 [2022-07-13 01:41:03,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:41:03,639 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 2 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5103 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:03,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5103 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 01:41:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5189 states. [2022-07-13 01:41:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5189 to 5189. [2022-07-13 01:41:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 4402 states have (on average 1.7330758746024535) internal successors, (7629), 5143 states have internal predecessors, (7629), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:41:03,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 7721 transitions. [2022-07-13 01:41:03,684 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 7721 transitions. Word has length 67 [2022-07-13 01:41:03,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:03,684 INFO L495 AbstractCegarLoop]: Abstraction has 5189 states and 7721 transitions. [2022-07-13 01:41:03,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:41:03,684 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 7721 transitions. [2022-07-13 01:41:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:41:03,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:03,685 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:03,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:03,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:03,887 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:03,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:03,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2022-07-13 01:41:03,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:03,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752922068] [2022-07-13 01:41:03,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:41:03,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:03,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:03,889 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:03,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-13 01:41:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:41:04,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:41:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:04,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:41:04,215 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-13 01:41:04,231 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 21 treesize of output 9 [2022-07-13 01:41:04,238 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-13 01:41:04,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:41:04,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:04,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752922068] [2022-07-13 01:41:04,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752922068] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:41:04,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:41:04,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:41:04,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956205418] [2022-07-13 01:41:04,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:41:04,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:41:04,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:04,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:41:04,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:41:04,267 INFO L87 Difference]: Start difference. First operand 5189 states and 7721 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:41:07,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:07,830 INFO L93 Difference]: Finished difference Result 5188 states and 7717 transitions. [2022-07-13 01:41:07,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:41:07,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-13 01:41:07,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:07,837 INFO L225 Difference]: With dead ends: 5188 [2022-07-13 01:41:07,837 INFO L226 Difference]: Without dead ends: 5188 [2022-07-13 01:41:07,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:41:07,838 INFO L413 NwaCegarLoop]: 1924 mSDtfsCounter, 4 mSDsluCounter, 3185 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5109 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:07,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5109 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-13 01:41:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5188 states. [2022-07-13 01:41:07,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5188 to 5188. [2022-07-13 01:41:07,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5188 states, 4402 states have (on average 1.7321671967287597) internal successors, (7625), 5142 states have internal predecessors, (7625), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:41:07,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5188 states to 5188 states and 7717 transitions. [2022-07-13 01:41:07,911 INFO L78 Accepts]: Start accepts. Automaton has 5188 states and 7717 transitions. Word has length 67 [2022-07-13 01:41:07,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:07,912 INFO L495 AbstractCegarLoop]: Abstraction has 5188 states and 7717 transitions. [2022-07-13 01:41:07,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:41:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 5188 states and 7717 transitions. [2022-07-13 01:41:07,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:41:07,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:07,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:07,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:08,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:08,123 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:08,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:08,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2022-07-13 01:41:08,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:08,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110568802] [2022-07-13 01:41:08,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:41:08,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:08,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:08,125 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:08,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-13 01:41:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:41:08,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:41:08,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:08,432 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-13 01:41:08,450 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-13 01:41:08,458 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-13 01:41:08,496 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 21 treesize of output 9 [2022-07-13 01:41:08,499 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 7 [2022-07-13 01:41:08,510 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-13 01:41:08,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:41:08,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:08,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110568802] [2022-07-13 01:41:08,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110568802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:41:08,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:41:08,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:41:08,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208827936] [2022-07-13 01:41:08,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:41:08,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:41:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:41:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:41:08,513 INFO L87 Difference]: Start difference. First operand 5188 states and 7717 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:41:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:13,460 INFO L93 Difference]: Finished difference Result 5187 states and 7713 transitions. [2022-07-13 01:41:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:41:13,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-13 01:41:13,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:13,466 INFO L225 Difference]: With dead ends: 5187 [2022-07-13 01:41:13,466 INFO L226 Difference]: Without dead ends: 5187 [2022-07-13 01:41:13,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:41:13,467 INFO L413 NwaCegarLoop]: 1924 mSDtfsCounter, 2 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5098 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:13,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5098 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-13 01:41:13,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5187 states. [2022-07-13 01:41:13,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5187 to 5187. [2022-07-13 01:41:13,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5187 states, 4398 states have (on average 1.7328331059572533) internal successors, (7621), 5141 states have internal predecessors, (7621), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-07-13 01:41:13,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 7713 transitions. [2022-07-13 01:41:13,515 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 7713 transitions. Word has length 67 [2022-07-13 01:41:13,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:13,515 INFO L495 AbstractCegarLoop]: Abstraction has 5187 states and 7713 transitions. [2022-07-13 01:41:13,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:41:13,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 7713 transitions. [2022-07-13 01:41:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 01:41:13,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:13,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:13,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:13,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:13,723 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:13,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:13,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1448028751, now seen corresponding path program 1 times [2022-07-13 01:41:13,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:13,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625155749] [2022-07-13 01:41:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:41:13,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:13,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:13,725 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:13,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-13 01:41:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:41:14,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:41:14,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:14,041 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-13 01:41:14,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:41:14,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:14,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625155749] [2022-07-13 01:41:14,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625155749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:41:14,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:41:14,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:41:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980116149] [2022-07-13 01:41:14,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:41:14,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:41:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:41:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:41:14,044 INFO L87 Difference]: Start difference. First operand 5187 states and 7713 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:41:14,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:14,131 INFO L93 Difference]: Finished difference Result 5190 states and 7722 transitions. [2022-07-13 01:41:14,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:41:14,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-07-13 01:41:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:14,153 INFO L225 Difference]: With dead ends: 5190 [2022-07-13 01:41:14,153 INFO L226 Difference]: Without dead ends: 5190 [2022-07-13 01:41:14,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:41:14,157 INFO L413 NwaCegarLoop]: 1923 mSDtfsCounter, 2 mSDsluCounter, 3838 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5761 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:14,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5761 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:41:14,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5190 states. [2022-07-13 01:41:14,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5190 to 5190. [2022-07-13 01:41:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5190 states, 4400 states have (on average 1.7327272727272727) internal successors, (7624), 5144 states have internal predecessors, (7624), 46 states have call successors, (46), 3 states have call predecessors, (46), 4 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:41:14,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5190 states to 5190 states and 7722 transitions. [2022-07-13 01:41:14,210 INFO L78 Accepts]: Start accepts. Automaton has 5190 states and 7722 transitions. Word has length 75 [2022-07-13 01:41:14,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:14,211 INFO L495 AbstractCegarLoop]: Abstraction has 5190 states and 7722 transitions. [2022-07-13 01:41:14,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:41:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5190 states and 7722 transitions. [2022-07-13 01:41:14,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:41:14,211 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:14,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:14,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:14,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:14,421 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:14,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1074294312, now seen corresponding path program 1 times [2022-07-13 01:41:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:14,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547426885] [2022-07-13 01:41:14,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:41:14,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:14,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:14,424 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:14,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-13 01:41:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:41:14,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:41:14,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:14,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:41:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:14,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:14,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547426885] [2022-07-13 01:41:14,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547426885] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:41:14,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:41:14,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 01:41:14,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678877977] [2022-07-13 01:41:14,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:41:14,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:41:14,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:14,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:41:14,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:41:14,828 INFO L87 Difference]: Start difference. First operand 5190 states and 7722 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:15,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:15,028 INFO L93 Difference]: Finished difference Result 5202 states and 7744 transitions. [2022-07-13 01:41:15,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:41:15,029 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-13 01:41:15,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:15,040 INFO L225 Difference]: With dead ends: 5202 [2022-07-13 01:41:15,040 INFO L226 Difference]: Without dead ends: 5202 [2022-07-13 01:41:15,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-13 01:41:15,041 INFO L413 NwaCegarLoop]: 1923 mSDtfsCounter, 16 mSDsluCounter, 5754 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7677 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:15,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7677 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:41:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5202 states. [2022-07-13 01:41:15,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5202 to 5200. [2022-07-13 01:41:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5200 states, 4409 states have (on average 1.732592424586074) internal successors, (7639), 5153 states have internal predecessors, (7639), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:41:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 7737 transitions. [2022-07-13 01:41:15,102 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 7737 transitions. Word has length 76 [2022-07-13 01:41:15,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:15,103 INFO L495 AbstractCegarLoop]: Abstraction has 5200 states and 7737 transitions. [2022-07-13 01:41:15,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:15,103 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 7737 transitions. [2022-07-13 01:41:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 01:41:15,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:15,105 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:15,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:15,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:15,325 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:15,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:15,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1670522737, now seen corresponding path program 2 times [2022-07-13 01:41:15,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:15,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [232877538] [2022-07-13 01:41:15,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:41:15,326 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:15,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:15,328 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:15,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-13 01:41:15,819 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:41:15,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:41:15,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:41:15,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:15,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:41:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:16,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:16,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [232877538] [2022-07-13 01:41:16,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [232877538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:41:16,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:41:16,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 01:41:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345650738] [2022-07-13 01:41:16,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:41:16,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:41:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:16,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:41:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:41:16,037 INFO L87 Difference]: Start difference. First operand 5200 states and 7737 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:16,640 INFO L93 Difference]: Finished difference Result 5221 states and 7785 transitions. [2022-07-13 01:41:16,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 01:41:16,641 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2022-07-13 01:41:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:16,653 INFO L225 Difference]: With dead ends: 5221 [2022-07-13 01:41:16,653 INFO L226 Difference]: Without dead ends: 5217 [2022-07-13 01:41:16,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-13 01:41:16,654 INFO L413 NwaCegarLoop]: 1926 mSDtfsCounter, 64 mSDsluCounter, 9608 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 11534 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:16,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 11534 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:41:16,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2022-07-13 01:41:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 5209. [2022-07-13 01:41:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5209 states, 4418 states have (on average 1.7317790855590764) internal successors, (7651), 5162 states have internal predecessors, (7651), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:41:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5209 states to 5209 states and 7749 transitions. [2022-07-13 01:41:16,724 INFO L78 Accepts]: Start accepts. Automaton has 5209 states and 7749 transitions. Word has length 79 [2022-07-13 01:41:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:16,724 INFO L495 AbstractCegarLoop]: Abstraction has 5209 states and 7749 transitions. [2022-07-13 01:41:16,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 5209 states and 7749 transitions. [2022-07-13 01:41:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 01:41:16,725 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:16,726 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:16,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:16,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:16,940 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:16,940 INFO L85 PathProgramCache]: Analyzing trace with hash 873906671, now seen corresponding path program 3 times [2022-07-13 01:41:16,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:16,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496576599] [2022-07-13 01:41:16,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:41:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:16,942 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:16,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-13 01:41:17,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 01:41:17,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:41:17,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:41:17,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:17,894 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:17,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:41:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:18,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:18,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496576599] [2022-07-13 01:41:18,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496576599] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:41:18,517 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:41:18,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 01:41:18,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437807312] [2022-07-13 01:41:18,517 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:41:18,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:41:18,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:18,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:41:18,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:41:18,518 INFO L87 Difference]: Start difference. First operand 5209 states and 7749 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:21,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:21,426 INFO L93 Difference]: Finished difference Result 5251 states and 7886 transitions. [2022-07-13 01:41:21,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 01:41:21,427 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2022-07-13 01:41:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:21,437 INFO L225 Difference]: With dead ends: 5251 [2022-07-13 01:41:21,437 INFO L226 Difference]: Without dead ends: 5245 [2022-07-13 01:41:21,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 01:41:21,439 INFO L413 NwaCegarLoop]: 1930 mSDtfsCounter, 192 mSDsluCounter, 21173 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 23103 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:21,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 23103 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 01:41:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5245 states. [2022-07-13 01:41:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5245 to 5227. [2022-07-13 01:41:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5227 states, 4436 states have (on average 1.729936880072137) internal successors, (7674), 5180 states have internal predecessors, (7674), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:41:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5227 states to 5227 states and 7772 transitions. [2022-07-13 01:41:21,502 INFO L78 Accepts]: Start accepts. Automaton has 5227 states and 7772 transitions. Word has length 85 [2022-07-13 01:41:21,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:21,503 INFO L495 AbstractCegarLoop]: Abstraction has 5227 states and 7772 transitions. [2022-07-13 01:41:21,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 5227 states and 7772 transitions. [2022-07-13 01:41:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 01:41:21,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:21,504 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:21,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-13 01:41:21,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:21,718 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:21,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:21,719 INFO L85 PathProgramCache]: Analyzing trace with hash -575079249, now seen corresponding path program 4 times [2022-07-13 01:41:21,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:21,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [522784545] [2022-07-13 01:41:21,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 01:41:21,720 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:21,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:21,721 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:21,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-13 01:41:22,099 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 01:41:22,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:41:22,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:41:22,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:22,489 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:22,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:41:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 01:41:23,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:23,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [522784545] [2022-07-13 01:41:23,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [522784545] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:41:23,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:41:23,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 01:41:23,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749141191] [2022-07-13 01:41:23,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:41:23,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:41:23,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:41:23,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:41:23,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:41:23,943 INFO L87 Difference]: Start difference. First operand 5227 states and 7772 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:41:35,598 INFO L93 Difference]: Finished difference Result 5307 states and 7989 transitions. [2022-07-13 01:41:35,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-13 01:41:35,599 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 97 [2022-07-13 01:41:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:41:35,607 INFO L225 Difference]: With dead ends: 5307 [2022-07-13 01:41:35,607 INFO L226 Difference]: Without dead ends: 5303 [2022-07-13 01:41:35,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 01:41:35,610 INFO L413 NwaCegarLoop]: 1943 mSDtfsCounter, 376 mSDsluCounter, 46494 mSDsCounter, 0 mSdLazyCounter, 3088 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 48437 SdHoareTripleChecker+Invalid, 3504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 3088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:41:35,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 48437 Invalid, 3504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 3088 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:41:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5303 states. [2022-07-13 01:41:35,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5303 to 5261. [2022-07-13 01:41:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 4470 states have (on average 1.7270693512304252) internal successors, (7720), 5214 states have internal predecessors, (7720), 46 states have call successors, (46), 4 states have call predecessors, (46), 5 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:41:35,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 7818 transitions. [2022-07-13 01:41:35,655 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 7818 transitions. Word has length 97 [2022-07-13 01:41:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:41:35,655 INFO L495 AbstractCegarLoop]: Abstraction has 5261 states and 7818 transitions. [2022-07-13 01:41:35,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 01:41:35,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 7818 transitions. [2022-07-13 01:41:35,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 01:41:35,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:41:35,656 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:41:35,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Ended with exit code 0 [2022-07-13 01:41:35,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:41:35,869 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:41:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:41:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2102212849, now seen corresponding path program 5 times [2022-07-13 01:41:35,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:41:35,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212722444] [2022-07-13 01:41:35,870 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:41:35,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:41:35,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:41:35,872 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:41:35,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-13 01:41:37,368 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:41:37,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:41:37,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-13 01:41:37,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:41:37,423 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-13 01:41:37,508 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:41:37,508 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 17 treesize of output 24 [2022-07-13 01:41:37,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:41:37,601 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 22 treesize of output 10 [2022-07-13 01:41:38,905 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:41:38,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-13 01:41:38,928 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 31 treesize of output 13 [2022-07-13 01:41:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-13 01:41:38,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:41:39,202 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:41:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212722444] [2022-07-13 01:41:39,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212722444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:41:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [155198439] [2022-07-13 01:41:39,202 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:41:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:41:39,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:41:39,204 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:41:39,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-13 01:43:08,800 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:43:08,800 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:43:09,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 01:43:09,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:43:09,056 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-13 01:43:09,122 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:43:09,123 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 17 treesize of output 24 [2022-07-13 01:43:09,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:43:09,170 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 22 treesize of output 10 [2022-07-13 01:43:10,164 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:43:10,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-07-13 01:43:10,189 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 31 treesize of output 13 [2022-07-13 01:43:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-13 01:43:10,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:43:10,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [155198439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:43:10,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:43:10,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-13 01:43:10,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095261199] [2022-07-13 01:43:10,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:43:10,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:43:10,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:43:10,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:43:10,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=92, Unknown=11, NotChecked=0, Total=132 [2022-07-13 01:43:10,367 INFO L87 Difference]: Start difference. First operand 5261 states and 7818 transitions. Second operand has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:43:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:43:13,727 INFO L93 Difference]: Finished difference Result 7816 states and 11874 transitions. [2022-07-13 01:43:13,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:43:13,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 119 [2022-07-13 01:43:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:43:13,737 INFO L225 Difference]: With dead ends: 7816 [2022-07-13 01:43:13,737 INFO L226 Difference]: Without dead ends: 7812 [2022-07-13 01:43:13,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 140 SyntacticMatches, 94 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=42, Invalid=127, Unknown=13, NotChecked=0, Total=182 [2022-07-13 01:43:13,738 INFO L413 NwaCegarLoop]: 1183 mSDtfsCounter, 1592 mSDsluCounter, 5197 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 6380 SdHoareTripleChecker+Invalid, 7187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4491 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:43:13,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 6380 Invalid, 7187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2684 Invalid, 0 Unknown, 4491 Unchecked, 3.2s Time] [2022-07-13 01:43:13,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7812 states. [2022-07-13 01:43:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7812 to 5309. [2022-07-13 01:43:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5309 states, 4518 states have (on average 1.7189021691013724) internal successors, (7766), 5261 states have internal predecessors, (7766), 46 states have call successors, (46), 5 states have call predecessors, (46), 6 states have return successors, (52), 43 states have call predecessors, (52), 46 states have call successors, (52) [2022-07-13 01:43:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5309 states to 5309 states and 7864 transitions. [2022-07-13 01:43:13,803 INFO L78 Accepts]: Start accepts. Automaton has 5309 states and 7864 transitions. Word has length 119 [2022-07-13 01:43:13,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:43:13,803 INFO L495 AbstractCegarLoop]: Abstraction has 5309 states and 7864 transitions. [2022-07-13 01:43:13,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 01:43:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 5309 states and 7864 transitions. [2022-07-13 01:43:13,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 01:43:13,804 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:43:13,805 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:43:13,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-13 01:43:14,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-13 01:43:14,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:43:14,216 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 1092 more)] === [2022-07-13 01:43:14,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:43:14,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2102212848, now seen corresponding path program 1 times [2022-07-13 01:43:14,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:43:14,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196701999] [2022-07-13 01:43:14,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:43:14,217 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:43:14,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:43:14,218 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:43:14,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-13 01:43:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:43:14,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-13 01:43:14,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:43:14,983 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-13 01:43:15,051 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-13 01:43:15,059 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:43:15,059 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 11 treesize of output 11 [2022-07-13 01:43:15,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-13 01:43:15,078 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-13 01:43:15,139 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 22 treesize of output 10 [2022-07-13 01:43:15,142 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 9 treesize of output 3 [2022-07-13 01:43:15,175 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3552 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3552))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3551 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3551) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:43:15,183 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3553 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3553))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3554 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3554) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:43:15,192 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3555 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3555))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3556 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3556) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:43:15,199 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3558 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3558))) (exists ((v_ArrVal_3557 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3557)))) is different from true [2022-07-13 01:43:15,248 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561)))) is different from true [2022-07-13 01:43:15,261 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:43:15,302 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3570 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3570))) (exists ((v_ArrVal_3569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3569)))) is different from true [2022-07-13 01:43:15,344 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576)))) is different from true [2022-07-13 01:43:15,367 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3579 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3579))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3580 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3580) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:43:15,391 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-07-13 01:43:15,416 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3588 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3588))) (exists ((v_ArrVal_3587 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3587) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:43:15,423 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590))) (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:43:15,430 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3591 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3591))) (exists ((v_ArrVal_3592 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3592)))) is different from true [2022-07-13 01:43:15,472 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3597 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3597))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3598 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3598)))) is different from true [2022-07-13 01:43:15,478 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:43:15,486 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3602) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3601 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3601) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:43:15,527 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607))) (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:43:15,534 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610)))) is different from true [2022-07-13 01:43:15,541 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3611 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3611))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3612 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3612)))) is different from true [2022-07-13 01:43:15,567 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616)))) is different from true [2022-07-13 01:43:15,593 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3620 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3620))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3619 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3619) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:43:15,600 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-07-13 01:43:15,608 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3624 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3624))) (exists ((v_ArrVal_3623 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3623)))) is different from true [2022-07-13 01:43:15,635 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627)))) is different from true [2022-07-13 01:43:15,661 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3631 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3631) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3632 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3632)))) is different from true [2022-07-13 01:43:15,688 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:43:15,696 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638)))) is different from true [2022-07-13 01:43:15,721 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:43:15,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-07-13 01:43:15,725 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 22 treesize of output 24 [2022-07-13 01:43:15,758 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 31 treesize of output 13 [2022-07-13 01:43:15,764 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 19 treesize of output 7 [2022-07-13 01:43:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 136 trivial. 837 not checked. [2022-07-13 01:43:15,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:43:16,441 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-13 01:43:16,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:43:16,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196701999] [2022-07-13 01:43:16,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196701999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:43:16,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012608352] [2022-07-13 01:43:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:43:16,449 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:43:16,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:43:16,450 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:43:16,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process