./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/lis-alloca-1.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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:22:09,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:22:09,048 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:22:09,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:22:09,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:22:09,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:22:09,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:22:09,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:22:09,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:22:09,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:22:09,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:22:09,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:22:09,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:22:09,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:22:09,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:22:09,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:22:09,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:22:09,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:22:09,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:22:09,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:22:09,121 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:22:09,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:22:09,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:22:09,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:22:09,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:22:09,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:22:09,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:22:09,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:22:09,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:22:09,133 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:22:09,134 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:22:09,134 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:22:09,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:22:09,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:22:09,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:22:09,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:22:09,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:22:09,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:22:09,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:22:09,138 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:22:09,139 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:22:09,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:22:09,142 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:22:09,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:22:09,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:22:09,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:22:09,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:22:09,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:22:09,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:22:09,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:22:09,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:22:09,172 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:22:09,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:22:09,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:22:09,173 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:22:09,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:22:09,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:22:09,174 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:22:09,174 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:22:09,174 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:22:09,174 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:22:09,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:22:09,175 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:22:09,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:22:09,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:22:09,175 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:22:09,175 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:22:09,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:22:09,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:22:09,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:22:09,176 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:22:09,176 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:22:09,177 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:22:09,177 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-07-12 18:22:09,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:22:09,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:22:09,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:22:09,400 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:22:09,400 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:22:09,401 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-12 18:22:09,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8744660c5/f906add3ad62418ca313bbd66116960f/FLAG4bdc7db43 [2022-07-12 18:22:09,851 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:22:09,852 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-12 18:22:09,867 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8744660c5/f906add3ad62418ca313bbd66116960f/FLAG4bdc7db43 [2022-07-12 18:22:10,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8744660c5/f906add3ad62418ca313bbd66116960f [2022-07-12 18:22:10,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:22:10,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:22:10,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:22:10,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:22:10,226 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:22:10,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:22:10" (1/1) ... [2022-07-12 18:22:10,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f5b934e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:10, skipping insertion in model container [2022-07-12 18:22:10,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:22:10" (1/1) ... [2022-07-12 18:22:10,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:22:10,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:22:10,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:22:10,512 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-12 18:22:10,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@436e064c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:10, skipping insertion in model container [2022-07-12 18:22:10,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:22:10,513 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-12 18:22:10,515 INFO L158 Benchmark]: Toolchain (without parser) took 290.96ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 58.5MB in the beginning and 89.5MB in the end (delta: -31.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 18:22:10,515 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 18:22:10,516 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.06ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 58.3MB in the beginning and 89.5MB in the end (delta: -31.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 18:22:10,517 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.16ms. Allocated memory is still 92.3MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.06ms. Allocated memory was 92.3MB in the beginning and 115.3MB in the end (delta: 23.1MB). Free memory was 58.3MB in the beginning and 89.5MB in the end (delta: -31.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety/lis-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:22:12,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:22:12,225 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:22:12,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:22:12,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:22:12,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:22:12,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:22:12,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:22:12,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:22:12,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:22:12,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:22:12,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:22:12,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:22:12,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:22:12,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:22:12,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:22:12,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:22:12,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:22:12,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:22:12,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:22:12,298 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:22:12,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:22:12,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:22:12,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:22:12,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:22:12,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:22:12,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:22:12,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:22:12,310 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:22:12,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:22:12,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:22:12,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:22:12,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:22:12,313 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:22:12,314 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:22:12,315 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:22:12,315 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:22:12,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:22:12,316 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:22:12,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:22:12,317 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:22:12,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:22:12,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-12 18:22:12,353 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:22:12,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:22:12,354 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:22:12,354 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:22:12,355 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:22:12,355 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:22:12,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:22:12,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:22:12,356 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:22:12,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:22:12,357 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:22:12,357 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:22:12,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:22:12,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:22:12,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:22:12,358 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:22:12,358 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:22:12,359 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:22:12,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:22:12,359 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:22:12,359 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 18:22:12,359 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 18:22:12,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:22:12,360 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:22:12,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:22:12,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:22:12,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:22:12,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:22:12,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:22:12,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:22:12,361 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 18:22:12,361 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 18:22:12,362 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 18:22:12,362 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 -> 319f31ab0b5c801309acd19f3e336c9a25177d3201cf5ea4438ad6227d5f71cf [2022-07-12 18:22:12,649 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:22:12,670 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:22:12,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:22:12,673 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:22:12,674 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:22:12,675 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-12 18:22:12,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4e5552f/0a2b1926c41941dfb0eec138142e4d76/FLAGc0c64ca5f [2022-07-12 18:22:13,213 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:22:13,214 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/lis-alloca-1.i [2022-07-12 18:22:13,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4e5552f/0a2b1926c41941dfb0eec138142e4d76/FLAGc0c64ca5f [2022-07-12 18:22:13,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c4e5552f/0a2b1926c41941dfb0eec138142e4d76 [2022-07-12 18:22:13,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:22:13,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:22:13,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:22:13,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:22:13,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:22:13,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:22:13" (1/1) ... [2022-07-12 18:22:13,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ff3e87a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:13, skipping insertion in model container [2022-07-12 18:22:13,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:22:13" (1/1) ... [2022-07-12 18:22:13,730 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:22:13,769 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:22:14,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:22:14,016 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-12 18:22:14,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:22:14,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:22:14,085 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:22:14,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:22:14,166 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:22:14,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14 WrapperNode [2022-07-12 18:22:14,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:22:14,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:22:14,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:22:14,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:22:14,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,237 INFO L137 Inliner]: procedures = 117, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 114 [2022-07-12 18:22:14,237 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:22:14,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:22:14,239 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:22:14,239 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:22:14,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,258 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,268 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,281 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:22:14,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:22:14,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:22:14,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:22:14,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (1/1) ... [2022-07-12 18:22:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:22:14,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:14,321 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-12 18:22:14,349 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-12 18:22:14,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 18:22:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:22:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:22:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 18:22:14,363 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:22:14,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:22:14,533 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:22:14,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:22:15,008 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:22:15,014 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:22:15,014 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 18:22:15,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:22:15 BoogieIcfgContainer [2022-07-12 18:22:15,017 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:22:15,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:22:15,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:22:15,021 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:22:15,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:22:13" (1/3) ... [2022-07-12 18:22:15,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ead9dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:22:15, skipping insertion in model container [2022-07-12 18:22:15,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:14" (2/3) ... [2022-07-12 18:22:15,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ead9dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:22:15, skipping insertion in model container [2022-07-12 18:22:15,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:22:15" (3/3) ... [2022-07-12 18:22:15,025 INFO L111 eAbstractionObserver]: Analyzing ICFG lis-alloca-1.i [2022-07-12 18:22:15,036 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:22:15,037 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-12 18:22:15,078 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:22:15,084 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@39362e05, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56bd53c8 [2022-07-12 18:22:15,087 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-12 18:22:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 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-12 18:22:15,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:22:15,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:15,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:22:15,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:15,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:15,109 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2022-07-12 18:22:15,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:15,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103728019] [2022-07-12 18:22:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:15,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:15,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:15,127 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-12 18:22:15,140 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-12 18:22:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:15,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:22:15,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:15,281 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-12 18:22:15,293 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-12 18:22:15,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:15,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:15,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103728019] [2022-07-12 18:22:15,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103728019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:15,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:15,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:22:15,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140078958] [2022-07-12 18:22:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:15,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:15,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:15,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:15,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:15,328 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.951219512195122) internal successors, (80), 66 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:15,480 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-07-12 18:22:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:15,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 18:22:15,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:15,494 INFO L225 Difference]: With dead ends: 66 [2022-07-12 18:22:15,495 INFO L226 Difference]: Without dead ends: 64 [2022-07-12 18:22:15,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:15,501 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 62 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:15,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:15,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-12 18:22:15,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-12 18:22:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.8) internal successors, (72), 63 states have internal predecessors, (72), 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-12 18:22:15,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-07-12 18:22:15,539 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 6 [2022-07-12 18:22:15,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:15,539 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-07-12 18:22:15,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-07-12 18:22:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:22:15,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:15,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:22:15,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:15,756 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-12 18:22:15,756 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:15,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:15,757 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2022-07-12 18:22:15,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:15,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532720124] [2022-07-12 18:22:15,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:15,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:15,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:15,759 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-12 18:22:15,761 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-12 18:22:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:15,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:22:15,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:15,814 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-12 18:22:15,842 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-12 18:22:15,842 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:15,842 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:15,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532720124] [2022-07-12 18:22:15,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532720124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:15,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:15,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:15,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856436459] [2022-07-12 18:22:15,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:15,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:15,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:15,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:15,846 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:16,174 INFO L93 Difference]: Finished difference Result 129 states and 144 transitions. [2022-07-12 18:22:16,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:16,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 18:22:16,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:16,176 INFO L225 Difference]: With dead ends: 129 [2022-07-12 18:22:16,177 INFO L226 Difference]: Without dead ends: 129 [2022-07-12 18:22:16,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 18:22:16,178 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 73 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:16,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 275 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:22:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-12 18:22:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 67. [2022-07-12 18:22:16,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.744186046511628) internal successors, (75), 66 states have internal predecessors, (75), 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-12 18:22:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-07-12 18:22:16,186 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 6 [2022-07-12 18:22:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:16,186 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-07-12 18:22:16,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-07-12 18:22:16,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:22:16,187 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:16,187 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:22:16,198 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-12 18:22:16,396 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-12 18:22:16,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:16,397 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2022-07-12 18:22:16,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:16,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544293530] [2022-07-12 18:22:16,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:16,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:16,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:16,399 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-12 18:22:16,400 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-12 18:22:16,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:16,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:22:16,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:16,495 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 8 treesize of output 7 [2022-07-12 18:22:16,575 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-12 18:22:16,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:16,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:16,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544293530] [2022-07-12 18:22:16,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544293530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:16,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:16,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:16,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769658335] [2022-07-12 18:22:16,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:16,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:16,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:16,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:16,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:16,578 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:16,622 INFO L93 Difference]: Finished difference Result 69 states and 78 transitions. [2022-07-12 18:22:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:22:16,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-12 18:22:16,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:16,623 INFO L225 Difference]: With dead ends: 69 [2022-07-12 18:22:16,624 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 18:22:16,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12 18:22:16,625 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:16,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 174 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 29 Unchecked, 0.0s Time] [2022-07-12 18:22:16,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 18:22:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-12 18:22:16,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.75) internal successors, (77), 67 states have internal predecessors, (77), 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-12 18:22:16,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-12 18:22:16,630 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 6 [2022-07-12 18:22:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:16,631 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-12 18:22:16,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-12 18:22:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-12 18:22:16,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:16,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:16,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:16,842 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-12 18:22:16,842 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:16,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 176742579, now seen corresponding path program 1 times [2022-07-12 18:22:16,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:16,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029502516] [2022-07-12 18:22:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:16,845 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-12 18:22:16,854 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-12 18:22:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:16,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:22:16,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:16,940 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-12 18:22:16,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:16,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:16,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029502516] [2022-07-12 18:22:16,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029502516] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:16,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:16,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842764724] [2022-07-12 18:22:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:16,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:16,947 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:16,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:16,980 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-07-12 18:22:16,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:16,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-12 18:22:16,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:16,983 INFO L225 Difference]: With dead ends: 70 [2022-07-12 18:22:16,983 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 18:22:16,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:16,985 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 71 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:16,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 129 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:16,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 18:22:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2022-07-12 18:22:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 65 states have internal predecessors, (74), 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-12 18:22:16,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2022-07-12 18:22:16,990 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 8 [2022-07-12 18:22:16,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:16,990 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2022-07-12 18:22:16,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-07-12 18:22:16,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:22:16,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:16,991 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:16,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-12 18:22:17,195 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-12 18:22:17,196 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:17,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:17,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2022-07-12 18:22:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:17,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569735747] [2022-07-12 18:22:17,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:17,197 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:17,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:17,199 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-12 18:22:17,200 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-12 18:22:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:17,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:22:17,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:17,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:17,315 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:17,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569735747] [2022-07-12 18:22:17,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569735747] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:17,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:17,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:22:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947856583] [2022-07-12 18:22:17,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:17,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:22:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:17,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:22:17,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:22:17,317 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:17,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:17,381 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2022-07-12 18:22:17,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:22:17,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:22:17,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:17,387 INFO L225 Difference]: With dead ends: 127 [2022-07-12 18:22:17,387 INFO L226 Difference]: Without dead ends: 127 [2022-07-12 18:22:17,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:22:17,389 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 317 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:17,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 255 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:17,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-12 18:22:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 72. [2022-07-12 18:22:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 71 states have internal predecessors, (80), 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-12 18:22:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-07-12 18:22:17,394 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 10 [2022-07-12 18:22:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:17,394 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-07-12 18:22:17,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-07-12 18:22:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:22:17,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:17,401 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:17,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:17,609 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-12 18:22:17,610 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:17,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:17,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2022-07-12 18:22:17,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:17,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856099017] [2022-07-12 18:22:17,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:17,611 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:17,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:17,613 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-12 18:22:17,615 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-12 18:22:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:17,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:22:17,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:17,692 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 8 treesize of output 7 [2022-07-12 18:22:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:17,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:18,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:18,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:18,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856099017] [2022-07-12 18:22:18,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856099017] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:18,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:18,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-12 18:22:18,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551536981] [2022-07-12 18:22:18,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:18,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:22:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:22:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:18,278 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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-12 18:22:19,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:19,036 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-07-12 18:22:19,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:22:19,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:22:19,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:19,041 INFO L225 Difference]: With dead ends: 135 [2022-07-12 18:22:19,041 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 18:22:19,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:22:19,042 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 324 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:19,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 267 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 152 Invalid, 0 Unknown, 5 Unchecked, 0.7s Time] [2022-07-12 18:22:19,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 18:22:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 80. [2022-07-12 18:22:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 79 states have internal predecessors, (90), 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-12 18:22:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-07-12 18:22:19,048 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 10 [2022-07-12 18:22:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:19,048 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-07-12 18:22:19,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 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-12 18:22:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-07-12 18:22:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:22:19,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:19,049 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:19,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-07-12 18:22:19,250 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-12 18:22:19,250 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:19,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash -680998152, now seen corresponding path program 1 times [2022-07-12 18:22:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:19,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445660466] [2022-07-12 18:22:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:19,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:19,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:19,252 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-12 18:22:19,253 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-12 18:22:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:19,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:22:19,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:19,321 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-12 18:22:19,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2022-07-12 18:22:19,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:19,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:19,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:19,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445660466] [2022-07-12 18:22:19,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445660466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:19,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:19,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:22:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126733461] [2022-07-12 18:22:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:19,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:19,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:19,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:19,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:19,334 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:19,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:19,436 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-07-12 18:22:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:22:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:19,438 INFO L225 Difference]: With dead ends: 73 [2022-07-12 18:22:19,438 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 18:22:19,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:19,439 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 49 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:19,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:19,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 18:22:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 18:22:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 72 states have internal predecessors, (83), 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-12 18:22:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-12 18:22:19,444 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 12 [2022-07-12 18:22:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:19,445 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-12 18:22:19,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-12 18:22:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:22:19,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:19,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:19,457 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-12 18:22:19,651 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-12 18:22:19,651 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:19,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:19,652 INFO L85 PathProgramCache]: Analyzing trace with hash -680998151, now seen corresponding path program 1 times [2022-07-12 18:22:19,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:19,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1596569395] [2022-07-12 18:22:19,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:19,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:19,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:19,653 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-12 18:22:19,654 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-12 18:22:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:19,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:22:19,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:19,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:19,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-12 18:22:19,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:19,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:19,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:19,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1596569395] [2022-07-12 18:22:19,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1596569395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:19,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:19,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442367348] [2022-07-12 18:22:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:19,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:19,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:19,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:19,770 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:19,969 INFO L93 Difference]: Finished difference Result 128 states and 145 transitions. [2022-07-12 18:22:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:19,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:22:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:19,971 INFO L225 Difference]: With dead ends: 128 [2022-07-12 18:22:19,971 INFO L226 Difference]: Without dead ends: 128 [2022-07-12 18:22:19,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:19,972 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 66 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:19,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 139 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:22:19,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-12 18:22:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 76. [2022-07-12 18:22:19,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 75 states have internal predecessors, (87), 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-12 18:22:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-12 18:22:19,977 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 12 [2022-07-12 18:22:19,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:19,977 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-12 18:22:19,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-12 18:22:19,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:22:19,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:19,978 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:19,987 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-12 18:22:20,187 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-12 18:22:20,187 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:20,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025161, now seen corresponding path program 1 times [2022-07-12 18:22:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271755133] [2022-07-12 18:22:20,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:20,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:20,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:20,189 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-12 18:22:20,190 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-12 18:22:20,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:20,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:22:20,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:20,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:20,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-07-12 18:22:20,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:20,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:20,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:20,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271755133] [2022-07-12 18:22:20,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1271755133] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:20,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:20,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:20,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978215401] [2022-07-12 18:22:20,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:20,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:22:20,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:20,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:22:20,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:20,348 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:20,543 INFO L93 Difference]: Finished difference Result 118 states and 135 transitions. [2022-07-12 18:22:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:22:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:22:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:20,544 INFO L225 Difference]: With dead ends: 118 [2022-07-12 18:22:20,544 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 18:22:20,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:22:20,545 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 51 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:20,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2022-07-12 18:22:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 18:22:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 75. [2022-07-12 18:22:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 58 states have (on average 1.4827586206896552) internal successors, (86), 74 states have internal predecessors, (86), 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-12 18:22:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2022-07-12 18:22:20,550 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 12 [2022-07-12 18:22:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:20,550 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2022-07-12 18:22:20,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2022-07-12 18:22:20,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:22:20,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:20,552 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:20,560 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-12 18:22:20,759 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-12 18:22:20,759 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:20,760 INFO L85 PathProgramCache]: Analyzing trace with hash 363893777, now seen corresponding path program 1 times [2022-07-12 18:22:20,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:20,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973603875] [2022-07-12 18:22:20,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:20,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:20,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:20,762 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-12 18:22:20,763 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-12 18:22:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:20,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:22:20,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:20,848 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 18:22:20,848 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 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-12 18:22:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:20,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:20,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:20,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973603875] [2022-07-12 18:22:20,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973603875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:20,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:20,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:22:20,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796329215] [2022-07-12 18:22:20,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:20,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:20,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:20,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:20,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:20,871 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-12 18:22:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:20,951 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-12 18:22:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-12 18:22:20,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:20,952 INFO L225 Difference]: With dead ends: 73 [2022-07-12 18:22:20,952 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 18:22:20,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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-12 18:22:20,953 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 46 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:20,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 54 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 18:22:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-12 18:22:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 72 states have internal predecessors, (84), 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-12 18:22:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-07-12 18:22:20,956 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 13 [2022-07-12 18:22:20,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:20,957 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-07-12 18:22:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 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-12 18:22:20,957 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-07-12 18:22:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:22:20,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:20,958 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:20,965 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-12 18:22:21,163 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-12 18:22:21,163 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 363893778, now seen corresponding path program 1 times [2022-07-12 18:22:21,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778538619] [2022-07-12 18:22:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:21,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:21,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:21,166 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-12 18:22:21,166 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-12 18:22:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:21,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:22:21,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:21,260 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:22:21,260 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:22:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:21,291 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:21,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778538619] [2022-07-12 18:22:21,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778538619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:21,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:21,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749105300] [2022-07-12 18:22:21,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:21,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:21,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:21,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:21,293 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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-12 18:22:21,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:21,511 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2022-07-12 18:22:21,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:21,511 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-12 18:22:21,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:21,512 INFO L225 Difference]: With dead ends: 124 [2022-07-12 18:22:21,512 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 18:22:21,512 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-12 18:22:21,512 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 59 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:21,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 133 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:22:21,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 18:22:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 77. [2022-07-12 18:22:21,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.435483870967742) internal successors, (89), 76 states have internal predecessors, (89), 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-12 18:22:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2022-07-12 18:22:21,515 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 13 [2022-07-12 18:22:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:21,515 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2022-07-12 18:22:21,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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-12 18:22:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2022-07-12 18:22:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:22:21,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:21,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:21,527 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-12 18:22:21,727 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-12 18:22:21,727 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1064958356, now seen corresponding path program 1 times [2022-07-12 18:22:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:21,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23443011] [2022-07-12 18:22:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:21,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:21,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:21,729 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-12 18:22:21,730 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-12 18:22:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:21,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:22:21,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:21,823 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-12 18:22:21,824 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-07-12 18:22:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:21,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:21,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:21,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23443011] [2022-07-12 18:22:21,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23443011] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:21,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:21,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:21,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078602151] [2022-07-12 18:22:21,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:21,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:22:21,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:21,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:22:21,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:21,890 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-12 18:22:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:22,079 INFO L93 Difference]: Finished difference Result 117 states and 134 transitions. [2022-07-12 18:22:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:22:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-12 18:22:22,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:22,083 INFO L225 Difference]: With dead ends: 117 [2022-07-12 18:22:22,083 INFO L226 Difference]: Without dead ends: 117 [2022-07-12 18:22:22,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:22:22,084 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 50 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:22,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 149 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-07-12 18:22:22,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-12 18:22:22,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2022-07-12 18:22:22,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.4406779661016949) internal successors, (85), 73 states have internal predecessors, (85), 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-12 18:22:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2022-07-12 18:22:22,087 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 13 [2022-07-12 18:22:22,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:22,087 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2022-07-12 18:22:22,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-12 18:22:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2022-07-12 18:22:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:22:22,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:22,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:22,098 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-12 18:22:22,297 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-12 18:22:22,297 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:22,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1808065813, now seen corresponding path program 1 times [2022-07-12 18:22:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:22,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654421307] [2022-07-12 18:22:22,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:22,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:22,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:22,300 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-12 18:22:22,302 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-12 18:22:22,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:22,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 18:22:22,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:22,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:22,378 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:22,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:22,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [654421307] [2022-07-12 18:22:22,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [654421307] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:22,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:22,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:22,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948494426] [2022-07-12 18:22:22,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:22,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:22,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:22,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:22,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:22,381 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:22,599 INFO L93 Difference]: Finished difference Result 124 states and 141 transitions. [2022-07-12 18:22:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:22,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:22:22,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:22,601 INFO L225 Difference]: With dead ends: 124 [2022-07-12 18:22:22,601 INFO L226 Difference]: Without dead ends: 124 [2022-07-12 18:22:22,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-12 18:22:22,602 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:22,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 208 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:22:22,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-12 18:22:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 76. [2022-07-12 18:22:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 75 states have internal predecessors, (87), 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-12 18:22:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2022-07-12 18:22:22,605 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 15 [2022-07-12 18:22:22,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:22,605 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2022-07-12 18:22:22,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2022-07-12 18:22:22,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:22:22,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:22,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:22,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-12 18:22:22,815 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-12 18:22:22,815 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1221259799, now seen corresponding path program 1 times [2022-07-12 18:22:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:22,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703059249] [2022-07-12 18:22:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:22,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:22,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:22,817 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-12 18:22:22,818 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-12 18:22:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:22,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 18:22:22,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:22,962 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-12 18:22:22,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:23,051 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-12 18:22:23,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:23,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703059249] [2022-07-12 18:22:23,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703059249] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:23,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:23,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-12 18:22:23,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081629813] [2022-07-12 18:22:23,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:23,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:22:23,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:23,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:22:23,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:22:23,053 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-12 18:22:23,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:23,431 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2022-07-12 18:22:23,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:22:23,432 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:22:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:23,433 INFO L225 Difference]: With dead ends: 126 [2022-07-12 18:22:23,433 INFO L226 Difference]: Without dead ends: 126 [2022-07-12 18:22:23,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:22:23,434 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 375 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:23,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 170 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:22:23,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-12 18:22:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 74. [2022-07-12 18:22:23,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.423728813559322) internal successors, (84), 73 states have internal predecessors, (84), 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-12 18:22:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-07-12 18:22:23,436 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 15 [2022-07-12 18:22:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:23,437 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-07-12 18:22:23,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 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-12 18:22:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-07-12 18:22:23,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:22:23,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:23,438 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:23,448 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-12 18:22:23,638 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-12 18:22:23,639 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 262068158, now seen corresponding path program 1 times [2022-07-12 18:22:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:23,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812180890] [2022-07-12 18:22:23,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:23,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:23,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:23,640 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-12 18:22:23,642 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-12 18:22:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:23,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:22:23,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:23,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:23,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:23,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:23,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812180890] [2022-07-12 18:22:23,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1812180890] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:23,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:23,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:22:23,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616893744] [2022-07-12 18:22:23,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:23,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:22:23,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:22:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:22:23,801 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-12 18:22:23,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:23,971 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-07-12 18:22:23,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:22:23,971 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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 16 [2022-07-12 18:22:23,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:23,972 INFO L225 Difference]: With dead ends: 96 [2022-07-12 18:22:23,972 INFO L226 Difference]: Without dead ends: 96 [2022-07-12 18:22:23,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:23,973 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:23,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 222 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:22:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-12 18:22:23,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-07-12 18:22:23,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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-12 18:22:23,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-07-12 18:22:23,974 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 16 [2022-07-12 18:22:23,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:23,975 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-07-12 18:22:23,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-12 18:22:23,975 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-07-12 18:22:23,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:22:23,975 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:23,976 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:23,984 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-12 18:22:24,183 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-12 18:22:24,183 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:24,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:24,184 INFO L85 PathProgramCache]: Analyzing trace with hash -749049092, now seen corresponding path program 1 times [2022-07-12 18:22:24,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:24,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352205888] [2022-07-12 18:22:24,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:24,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:24,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:24,185 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-12 18:22:24,186 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-12 18:22:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:24,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 18:22:24,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:24,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:24,462 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:24,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352205888] [2022-07-12 18:22:24,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352205888] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:24,462 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:24,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2022-07-12 18:22:24,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45796783] [2022-07-12 18:22:24,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:24,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:22:24,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:24,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:22:24,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:22:24,464 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-12 18:22:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:24,844 INFO L93 Difference]: Finished difference Result 112 states and 125 transitions. [2022-07-12 18:22:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:22:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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 16 [2022-07-12 18:22:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:24,846 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:22:24,846 INFO L226 Difference]: Without dead ends: 112 [2022-07-12 18:22:24,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:22:24,847 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 147 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:24,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 349 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:22:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-12 18:22:24,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 90. [2022-07-12 18:22:24,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 89 states have internal predecessors, (103), 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-12 18:22:24,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 103 transitions. [2022-07-12 18:22:24,850 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 103 transitions. Word has length 16 [2022-07-12 18:22:24,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:24,850 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 103 transitions. [2022-07-12 18:22:24,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 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-12 18:22:24,851 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 103 transitions. [2022-07-12 18:22:24,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:22:24,851 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:24,851 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1] [2022-07-12 18:22:24,858 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-12 18:22:25,055 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-12 18:22:25,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:25,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1817992175, now seen corresponding path program 2 times [2022-07-12 18:22:25,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:25,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222737103] [2022-07-12 18:22:25,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:25,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:25,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:25,057 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-12 18:22:25,059 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-12 18:22:25,118 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:22:25,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:25,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:22:25,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:25,141 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 8 treesize of output 7 [2022-07-12 18:22:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:25,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:26,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:26,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222737103] [2022-07-12 18:22:26,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222737103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:26,169 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:26,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-07-12 18:22:26,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8912545] [2022-07-12 18:22:26,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:26,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 18:22:26,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:26,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 18:22:26,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:22:26,170 INFO L87 Difference]: Start difference. First operand 90 states and 103 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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-12 18:22:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:28,594 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-07-12 18:22:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:22:28,596 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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 18 [2022-07-12 18:22:28,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:28,596 INFO L225 Difference]: With dead ends: 212 [2022-07-12 18:22:28,596 INFO L226 Difference]: Without dead ends: 212 [2022-07-12 18:22:28,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:22:28,597 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 427 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:28,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 619 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 464 Invalid, 0 Unknown, 9 Unchecked, 1.4s Time] [2022-07-12 18:22:28,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-07-12 18:22:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 106. [2022-07-12 18:22:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 105 states have internal predecessors, (123), 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-12 18:22:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-07-12 18:22:28,600 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 123 transitions. Word has length 18 [2022-07-12 18:22:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:28,600 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-07-12 18:22:28,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 14 states have internal predecessors, (34), 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-12 18:22:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2022-07-12 18:22:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:22:28,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:28,601 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-12 18:22:28,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-12 18:22:28,812 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-12 18:22:28,812 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:28,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash -302012765, now seen corresponding path program 1 times [2022-07-12 18:22:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:28,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421862446] [2022-07-12 18:22:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:28,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:28,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:28,814 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-12 18:22:28,815 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-12 18:22:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:28,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 18:22:28,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:28,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:28,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:29,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-12 18:22:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:29,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:29,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421862446] [2022-07-12 18:22:29,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421862446] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:29,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:29,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-12 18:22:29,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887335472] [2022-07-12 18:22:29,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:29,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:22:29,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:29,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:22:29,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:22:29,116 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:29,726 INFO L93 Difference]: Finished difference Result 163 states and 187 transitions. [2022-07-12 18:22:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:29,727 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-12 18:22:29,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:29,728 INFO L225 Difference]: With dead ends: 163 [2022-07-12 18:22:29,728 INFO L226 Difference]: Without dead ends: 163 [2022-07-12 18:22:29,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:29,728 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 165 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:29,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 157 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:22:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-12 18:22:29,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2022-07-12 18:22:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 116 states have internal predecessors, (141), 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-12 18:22:29,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 141 transitions. [2022-07-12 18:22:29,732 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 141 transitions. Word has length 20 [2022-07-12 18:22:29,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:29,732 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 141 transitions. [2022-07-12 18:22:29,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:29,732 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 141 transitions. [2022-07-12 18:22:29,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:22:29,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:29,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:29,746 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-12 18:22:29,942 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-12 18:22:29,942 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:29,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:29,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1581646975, now seen corresponding path program 2 times [2022-07-12 18:22:29,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:29,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636081256] [2022-07-12 18:22:29,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:29,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:29,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:29,944 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-12 18:22:29,945 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-12 18:22:30,022 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:22:30,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:30,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:22:30,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:30,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:30,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-07-12 18:22:30,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:30,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:30,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:30,514 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:30,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636081256] [2022-07-12 18:22:30,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636081256] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:30,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:30,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-12 18:22:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697401649] [2022-07-12 18:22:30,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:30,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:22:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:30,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:22:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:30,516 INFO L87 Difference]: Start difference. First operand 117 states and 141 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-12 18:22:31,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:31,299 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2022-07-12 18:22:31,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:22:31,300 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-12 18:22:31,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:31,300 INFO L225 Difference]: With dead ends: 161 [2022-07-12 18:22:31,301 INFO L226 Difference]: Without dead ends: 161 [2022-07-12 18:22:31,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:22:31,301 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 114 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:31,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 247 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 226 Invalid, 0 Unknown, 69 Unchecked, 0.6s Time] [2022-07-12 18:22:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-12 18:22:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 133. [2022-07-12 18:22:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 119 states have (on average 1.3697478991596639) internal successors, (163), 132 states have internal predecessors, (163), 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-12 18:22:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 163 transitions. [2022-07-12 18:22:31,305 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 163 transitions. Word has length 20 [2022-07-12 18:22:31,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:31,305 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 163 transitions. [2022-07-12 18:22:31,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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-12 18:22:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 163 transitions. [2022-07-12 18:22:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:22:31,306 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:31,306 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:31,313 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-12 18:22:31,509 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-12 18:22:31,510 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1786415948, now seen corresponding path program 1 times [2022-07-12 18:22:31,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:31,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499434783] [2022-07-12 18:22:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:31,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:31,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:31,512 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-12 18:22:31,517 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-12 18:22:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:31,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:22:31,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:31,643 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-12 18:22:31,644 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-07-12 18:22:31,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:31,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:32,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:32,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499434783] [2022-07-12 18:22:32,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499434783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:32,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:32,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-12 18:22:32,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959280092] [2022-07-12 18:22:32,329 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:32,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:22:32,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:32,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:22:32,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:22:32,330 INFO L87 Difference]: Start difference. First operand 133 states and 163 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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-12 18:22:33,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:33,368 INFO L93 Difference]: Finished difference Result 153 states and 186 transitions. [2022-07-12 18:22:33,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:22:33,369 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 18:22:33,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:33,370 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:22:33,370 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:22:33,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:22:33,371 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 123 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:33,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 255 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 226 Invalid, 0 Unknown, 29 Unchecked, 0.7s Time] [2022-07-12 18:22:33,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:22:33,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2022-07-12 18:22:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 120 states have (on average 1.35) internal successors, (162), 133 states have internal predecessors, (162), 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-12 18:22:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2022-07-12 18:22:33,374 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 21 [2022-07-12 18:22:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:33,374 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2022-07-12 18:22:33,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 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-12 18:22:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2022-07-12 18:22:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 18:22:33,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:33,375 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:33,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:33,583 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-12 18:22:33,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:33,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:33,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1242696241, now seen corresponding path program 1 times [2022-07-12 18:22:33,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:33,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850523330] [2022-07-12 18:22:33,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:33,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:33,586 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-12 18:22:33,618 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-12 18:22:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:33,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:22:33,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:33,693 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 8 treesize of output 7 [2022-07-12 18:22:33,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 18:22:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:33,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:34,215 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:34,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:34,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850523330] [2022-07-12 18:22:34,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850523330] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:34,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:34,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-12 18:22:34,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343598876] [2022-07-12 18:22:34,216 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:34,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:22:34,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:22:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:22:34,217 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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-12 18:22:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:35,030 INFO L93 Difference]: Finished difference Result 197 states and 237 transitions. [2022-07-12 18:22:35,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:22:35,031 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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 23 [2022-07-12 18:22:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:35,032 INFO L225 Difference]: With dead ends: 197 [2022-07-12 18:22:35,032 INFO L226 Difference]: Without dead ends: 197 [2022-07-12 18:22:35,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:22:35,033 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 681 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:35,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 386 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:22:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-12 18:22:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 125. [2022-07-12 18:22:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 124 states have internal predecessors, (150), 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-12 18:22:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 150 transitions. [2022-07-12 18:22:35,037 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 150 transitions. Word has length 23 [2022-07-12 18:22:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:35,037 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 150 transitions. [2022-07-12 18:22:35,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 18 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-12 18:22:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 150 transitions. [2022-07-12 18:22:35,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:22:35,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:35,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:35,047 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-12 18:22:35,247 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-12 18:22:35,247 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:35,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1547664583, now seen corresponding path program 1 times [2022-07-12 18:22:35,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:35,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897830127] [2022-07-12 18:22:35,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:35,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:35,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:35,249 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-12 18:22:35,250 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-12 18:22:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 18:22:35,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:35,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:35,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:35,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:35,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2022-07-12 18:22:35,437 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 45 treesize of output 41 [2022-07-12 18:22:35,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:35,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2022-07-12 18:22:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:35,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:35,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:22:35,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:35,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:35,703 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:35,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:35,792 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-12 18:22:35,792 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 95 [2022-07-12 18:22:35,961 INFO L356 Elim1Store]: treesize reduction 359, result has 10.3 percent of original size [2022-07-12 18:22:35,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 98 [2022-07-12 18:22:35,988 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-12 18:22:35,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 27 treesize of output 13 [2022-07-12 18:22:36,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:22:36,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:36,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897830127] [2022-07-12 18:22:36,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897830127] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:36,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:36,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-12 18:22:36,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818901121] [2022-07-12 18:22:36,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:36,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:22:36,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:36,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:22:36,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2022-07-12 18:22:36,245 INFO L87 Difference]: Start difference. First operand 125 states and 150 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-12 18:22:37,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 18:22:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:37,912 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2022-07-12 18:22:37,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:37,913 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-12 18:22:37,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:37,914 INFO L225 Difference]: With dead ends: 167 [2022-07-12 18:22:37,914 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 18:22:37,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=127, Unknown=1, NotChecked=24, Total=210 [2022-07-12 18:22:37,915 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:37,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 225 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 190 Invalid, 0 Unknown, 52 Unchecked, 1.5s Time] [2022-07-12 18:22:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 18:22:37,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 149. [2022-07-12 18:22:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 135 states have (on average 1.4148148148148147) internal successors, (191), 148 states have internal predecessors, (191), 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-12 18:22:37,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 191 transitions. [2022-07-12 18:22:37,918 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 191 transitions. Word has length 26 [2022-07-12 18:22:37,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:37,918 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 191 transitions. [2022-07-12 18:22:37,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 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-12 18:22:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 191 transitions. [2022-07-12 18:22:37,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:22:37,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:37,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:37,930 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-12 18:22:38,128 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-12 18:22:38,128 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:38,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844182, now seen corresponding path program 2 times [2022-07-12 18:22:38,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:38,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1808043108] [2022-07-12 18:22:38,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:38,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:38,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:38,130 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-12 18:22:38,131 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-12 18:22:38,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:22:38,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:38,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 18:22:38,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:38,198 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-12 18:22:38,245 INFO L356 Elim1Store]: treesize reduction 43, result has 31.7 percent of original size [2022-07-12 18:22:38,246 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 4 case distinctions, treesize of input 20 treesize of output 31 [2022-07-12 18:22:38,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:22:38,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:38,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:38,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1808043108] [2022-07-12 18:22:38,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1808043108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:38,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:38,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:38,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54645852] [2022-07-12 18:22:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:38,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:38,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:38,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:38,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:38,373 INFO L87 Difference]: Start difference. First operand 149 states and 191 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:38,455 INFO L93 Difference]: Finished difference Result 157 states and 203 transitions. [2022-07-12 18:22:38,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:22:38,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:22:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:38,456 INFO L225 Difference]: With dead ends: 157 [2022-07-12 18:22:38,457 INFO L226 Difference]: Without dead ends: 157 [2022-07-12 18:22:38,457 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-12 18:22:38,457 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:38,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-07-12 18:22:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-12 18:22:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-07-12 18:22:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 139 states have (on average 1.4244604316546763) internal successors, (198), 152 states have internal predecessors, (198), 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-12 18:22:38,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 198 transitions. [2022-07-12 18:22:38,460 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 198 transitions. Word has length 27 [2022-07-12 18:22:38,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:38,461 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 198 transitions. [2022-07-12 18:22:38,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:38,461 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 198 transitions. [2022-07-12 18:22:38,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:22:38,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:38,461 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:38,474 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-12 18:22:38,661 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-12 18:22:38,662 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:38,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1090844181, now seen corresponding path program 1 times [2022-07-12 18:22:38,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:38,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204009088] [2022-07-12 18:22:38,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:38,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:38,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:38,664 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-12 18:22:38,664 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-12 18:22:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:38,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-12 18:22:38,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:38,786 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 8 treesize of output 7 [2022-07-12 18:22:38,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:38,936 INFO L356 Elim1Store]: treesize reduction 35, result has 12.5 percent of original size [2022-07-12 18:22:38,936 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 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-12 18:22:38,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:39,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:39,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:40,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:40,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204009088] [2022-07-12 18:22:40,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204009088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:40,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:40,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2022-07-12 18:22:40,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136089005] [2022-07-12 18:22:40,061 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:40,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 18:22:40,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:40,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 18:22:40,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:22:40,062 INFO L87 Difference]: Start difference. First operand 153 states and 198 transitions. Second operand has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:40,593 INFO L93 Difference]: Finished difference Result 160 states and 206 transitions. [2022-07-12 18:22:40,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:22:40,595 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-12 18:22:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:40,596 INFO L225 Difference]: With dead ends: 160 [2022-07-12 18:22:40,596 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:22:40,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-12 18:22:40,597 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 36 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:40,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 324 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 94 Unchecked, 0.4s Time] [2022-07-12 18:22:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:22:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2022-07-12 18:22:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 142 states have (on average 1.4295774647887325) internal successors, (203), 155 states have internal predecessors, (203), 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-12 18:22:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2022-07-12 18:22:40,600 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 27 [2022-07-12 18:22:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:40,601 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2022-07-12 18:22:40,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2022-07-12 18:22:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:22:40,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:40,601 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] [2022-07-12 18:22:40,613 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-12 18:22:40,811 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-12 18:22:40,811 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:40,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:40,812 INFO L85 PathProgramCache]: Analyzing trace with hash -397297604, now seen corresponding path program 1 times [2022-07-12 18:22:40,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:40,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682874066] [2022-07-12 18:22:40,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:40,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:40,814 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-12 18:22:40,831 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-12 18:22:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:40,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:22:40,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-12 18:22:47,250 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:47,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:47,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682874066] [2022-07-12 18:22:47,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682874066] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:47,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:47,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:22:47,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109182289] [2022-07-12 18:22:47,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:47,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:22:47,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:47,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:22:47,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-12 18:22:47,251 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-12 18:22:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:47,306 INFO L93 Difference]: Finished difference Result 171 states and 219 transitions. [2022-07-12 18:22:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:47,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2022-07-12 18:22:47,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:47,308 INFO L225 Difference]: With dead ends: 171 [2022-07-12 18:22:47,308 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:22:47,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-12 18:22:47,308 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 11 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:47,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 162 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-07-12 18:22:47,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:22:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-07-12 18:22:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 130 states have (on average 1.4692307692307693) internal successors, (191), 143 states have internal predecessors, (191), 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-12 18:22:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 191 transitions. [2022-07-12 18:22:47,312 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 191 transitions. Word has length 28 [2022-07-12 18:22:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:47,312 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 191 transitions. [2022-07-12 18:22:47,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-12 18:22:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2022-07-12 18:22:47,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:22:47,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:47,312 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:47,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-07-12 18:22:47,527 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-12 18:22:47,527 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:47,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash 543568763, now seen corresponding path program 1 times [2022-07-12 18:22:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:47,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182386767] [2022-07-12 18:22:47,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:47,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:47,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:47,530 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-12 18:22:47,530 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-12 18:22:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:47,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:22:47,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:22:47,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:47,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:47,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182386767] [2022-07-12 18:22:47,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182386767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:47,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:47,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:22:47,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925391696] [2022-07-12 18:22:47,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:47,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:47,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:47,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:47,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:47,620 INFO L87 Difference]: Start difference. First operand 144 states and 191 transitions. Second operand has 3 states, 2 states have (on average 10.0) 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-12 18:22:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:47,723 INFO L93 Difference]: Finished difference Result 144 states and 183 transitions. [2022-07-12 18:22:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:47,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) 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 28 [2022-07-12 18:22:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:47,724 INFO L225 Difference]: With dead ends: 144 [2022-07-12 18:22:47,724 INFO L226 Difference]: Without dead ends: 144 [2022-07-12 18:22:47,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-12 18:22:47,725 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 36 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:47,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 87 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:47,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-12 18:22:47,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2022-07-12 18:22:47,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 140 states have internal predecessors, (181), 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-12 18:22:47,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 181 transitions. [2022-07-12 18:22:47,728 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 181 transitions. Word has length 28 [2022-07-12 18:22:47,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:47,729 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 181 transitions. [2022-07-12 18:22:47,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) 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-12 18:22:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2022-07-12 18:22:47,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:22:47,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:47,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:47,739 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-12 18:22:47,939 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-12 18:22:47,939 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:47,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:47,939 INFO L85 PathProgramCache]: Analyzing trace with hash 543568764, now seen corresponding path program 1 times [2022-07-12 18:22:47,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:47,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475676911] [2022-07-12 18:22:47,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:47,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:47,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:47,941 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-12 18:22:47,942 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-12 18:22:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:48,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:22:48,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:22:48,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:48,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:48,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475676911] [2022-07-12 18:22:48,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475676911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:48,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:48,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:22:48,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150705964] [2022-07-12 18:22:48,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:48,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:22:48,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:48,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:22:48,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:22:48,129 INFO L87 Difference]: Start difference. First operand 141 states and 181 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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-12 18:22:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:48,368 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2022-07-12 18:22:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:48,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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 28 [2022-07-12 18:22:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:48,370 INFO L225 Difference]: With dead ends: 203 [2022-07-12 18:22:48,370 INFO L226 Difference]: Without dead ends: 203 [2022-07-12 18:22:48,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:22:48,371 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 270 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:48,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 92 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:22:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-12 18:22:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 139. [2022-07-12 18:22:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 127 states have (on average 1.3858267716535433) internal successors, (176), 138 states have internal predecessors, (176), 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-12 18:22:48,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 176 transitions. [2022-07-12 18:22:48,375 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 176 transitions. Word has length 28 [2022-07-12 18:22:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:48,375 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 176 transitions. [2022-07-12 18:22:48,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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-12 18:22:48,375 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 176 transitions. [2022-07-12 18:22:48,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 18:22:48,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:48,376 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:48,386 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-12 18:22:48,586 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-12 18:22:48,586 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:48,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 590171529, now seen corresponding path program 3 times [2022-07-12 18:22:48,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:48,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280862271] [2022-07-12 18:22:48,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:22:48,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:48,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:48,589 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-12 18:22:48,590 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-12 18:22:48,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 18:22:48,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:48,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-12 18:22:48,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:48,755 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 8 treesize of output 7 [2022-07-12 18:22:48,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:48,934 INFO L356 Elim1Store]: treesize reduction 29, result has 23.7 percent of original size [2022-07-12 18:22:48,934 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 1 case distinctions, treesize of input 24 treesize of output 30 [2022-07-12 18:22:48,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:49,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:50,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:50,795 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280862271] [2022-07-12 18:22:50,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280862271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:50,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2022-07-12 18:22:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076088814] [2022-07-12 18:22:50,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:50,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 18:22:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 18:22:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2022-07-12 18:22:50,797 INFO L87 Difference]: Start difference. First operand 139 states and 176 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 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-12 18:22:53,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:53,395 INFO L93 Difference]: Finished difference Result 240 states and 292 transitions. [2022-07-12 18:22:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:22:53,396 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 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 28 [2022-07-12 18:22:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:53,397 INFO L225 Difference]: With dead ends: 240 [2022-07-12 18:22:53,397 INFO L226 Difference]: Without dead ends: 240 [2022-07-12 18:22:53,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:22:53,398 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 291 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 217 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:53,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 293 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 397 Invalid, 0 Unknown, 217 Unchecked, 1.4s Time] [2022-07-12 18:22:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-07-12 18:22:53,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 215. [2022-07-12 18:22:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 214 states have internal predecessors, (270), 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-12 18:22:53,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 270 transitions. [2022-07-12 18:22:53,402 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 270 transitions. Word has length 28 [2022-07-12 18:22:53,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:53,403 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 270 transitions. [2022-07-12 18:22:53,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 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-12 18:22:53,403 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 270 transitions. [2022-07-12 18:22:53,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:22:53,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:53,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:53,414 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-12 18:22:53,613 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-12 18:22:53,614 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:53,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:53,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1391261449, now seen corresponding path program 1 times [2022-07-12 18:22:53,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:53,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825018588] [2022-07-12 18:22:53,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:53,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:53,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:53,617 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-12 18:22:53,618 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-12 18:22:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:53,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 18:22:53,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:53,726 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:22:53,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:22:53,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:53,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825018588] [2022-07-12 18:22:53,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825018588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:53,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:53,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:53,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043178290] [2022-07-12 18:22:53,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:53,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:53,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:53,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:53,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:53,728 INFO L87 Difference]: Start difference. First operand 215 states and 270 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12 18:22:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:53,739 INFO L93 Difference]: Finished difference Result 216 states and 268 transitions. [2022-07-12 18:22:53,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:53,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 32 [2022-07-12 18:22:53,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:53,741 INFO L225 Difference]: With dead ends: 216 [2022-07-12 18:22:53,741 INFO L226 Difference]: Without dead ends: 216 [2022-07-12 18:22:53,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-12 18:22:53,742 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:53,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:53,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-07-12 18:22:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-12 18:22:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 205 states have (on average 1.3073170731707318) internal successors, (268), 215 states have internal predecessors, (268), 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-12 18:22:53,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 268 transitions. [2022-07-12 18:22:53,746 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 268 transitions. Word has length 32 [2022-07-12 18:22:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:53,747 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 268 transitions. [2022-07-12 18:22:53,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-12 18:22:53,747 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 268 transitions. [2022-07-12 18:22:53,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:22:53,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:53,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:53,758 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-12 18:22:53,957 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-12 18:22:53,958 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:53,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:53,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1391252418, now seen corresponding path program 1 times [2022-07-12 18:22:53,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:53,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317274505] [2022-07-12 18:22:53,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:53,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:53,960 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-12 18:22:53,960 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-12 18:22:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:54,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:22:54,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:54,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:54,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-12 18:22:54,506 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:22:54,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:54,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317274505] [2022-07-12 18:22:54,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317274505] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:54,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:54,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-07-12 18:22:54,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39769022] [2022-07-12 18:22:54,507 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:54,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:22:54,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:54,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:22:54,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:54,508 INFO L87 Difference]: Start difference. First operand 216 states and 268 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 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-12 18:22:55,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:55,820 INFO L93 Difference]: Finished difference Result 802 states and 1009 transitions. [2022-07-12 18:22:55,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:22:55,821 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 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 32 [2022-07-12 18:22:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:55,824 INFO L225 Difference]: With dead ends: 802 [2022-07-12 18:22:55,824 INFO L226 Difference]: Without dead ends: 802 [2022-07-12 18:22:55,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:22:55,825 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 832 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 832 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:55,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [832 Valid, 230 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 18:22:55,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2022-07-12 18:22:55,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 311. [2022-07-12 18:22:55,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 301 states have (on average 1.3521594684385383) internal successors, (407), 310 states have internal predecessors, (407), 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-12 18:22:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 407 transitions. [2022-07-12 18:22:55,837 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 407 transitions. Word has length 32 [2022-07-12 18:22:55,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:55,838 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 407 transitions. [2022-07-12 18:22:55,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 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-12 18:22:55,838 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 407 transitions. [2022-07-12 18:22:55,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:22:55,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:55,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:55,851 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-12 18:22:56,048 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-12 18:22:56,049 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:56,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:56,049 INFO L85 PathProgramCache]: Analyzing trace with hash 795842271, now seen corresponding path program 2 times [2022-07-12 18:22:56,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:56,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439804696] [2022-07-12 18:22:56,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:56,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:56,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:56,051 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-12 18:22:56,053 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-12 18:22:56,150 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:22:56,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:56,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-12 18:22:56,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:56,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:22:56,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 18:22:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:22:56,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:58,531 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-12 18:22:58,534 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:22:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439804696] [2022-07-12 18:22:58,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439804696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:58,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:22:58,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 6 [2022-07-12 18:22:58,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280591217] [2022-07-12 18:22:58,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:58,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:22:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:22:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:22:58,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:22:58,536 INFO L87 Difference]: Start difference. First operand 311 states and 407 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-12 18:22:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:58,833 INFO L93 Difference]: Finished difference Result 322 states and 423 transitions. [2022-07-12 18:22:58,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:58,833 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 18:22:58,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:58,835 INFO L225 Difference]: With dead ends: 322 [2022-07-12 18:22:58,835 INFO L226 Difference]: Without dead ends: 322 [2022-07-12 18:22:58,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:22:58,835 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:58,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 139 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-07-12 18:22:58,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-12 18:22:58,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 304. [2022-07-12 18:22:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 295 states have (on average 1.352542372881356) internal successors, (399), 303 states have internal predecessors, (399), 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-12 18:22:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 399 transitions. [2022-07-12 18:22:58,842 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 399 transitions. Word has length 33 [2022-07-12 18:22:58,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:58,842 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 399 transitions. [2022-07-12 18:22:58,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 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-12 18:22:58,842 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 399 transitions. [2022-07-12 18:22:58,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:22:58,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:58,843 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1] [2022-07-12 18:22:58,855 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-12 18:22:59,052 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-12 18:22:59,053 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:22:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:59,053 INFO L85 PathProgramCache]: Analyzing trace with hash -563143139, now seen corresponding path program 3 times [2022-07-12 18:22:59,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:22:59,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279752733] [2022-07-12 18:22:59,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:22:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:22:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:22:59,054 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-12 18:22:59,055 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-12 18:22:59,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-12 18:22:59,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:59,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:22:59,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:59,211 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 8 treesize of output 7 [2022-07-12 18:22:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:59,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:02,725 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:02,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:02,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279752733] [2022-07-12 18:23:02,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279752733] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:02,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:02,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2022-07-12 18:23:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010819220] [2022-07-12 18:23:02,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:02,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:23:02,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:02,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:23:02,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:23:02,727 INFO L87 Difference]: Start difference. First operand 304 states and 399 transitions. Second operand has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 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-12 18:23:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:20,519 INFO L93 Difference]: Finished difference Result 1193 states and 1602 transitions. [2022-07-12 18:23:20,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 18:23:20,520 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 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 34 [2022-07-12 18:23:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:20,523 INFO L225 Difference]: With dead ends: 1193 [2022-07-12 18:23:20,523 INFO L226 Difference]: Without dead ends: 1193 [2022-07-12 18:23:20,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=547, Invalid=1259, Unknown=0, NotChecked=0, Total=1806 [2022-07-12 18:23:20,524 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 1453 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 1623 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 2006 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:20,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 2006 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1623 Invalid, 0 Unknown, 25 Unchecked, 5.8s Time] [2022-07-12 18:23:20,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2022-07-12 18:23:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 336. [2022-07-12 18:23:20,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 327 states have (on average 1.342507645259939) internal successors, (439), 335 states have internal predecessors, (439), 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-12 18:23:20,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 439 transitions. [2022-07-12 18:23:20,533 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 439 transitions. Word has length 34 [2022-07-12 18:23:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:20,534 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 439 transitions. [2022-07-12 18:23:20,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.869565217391304) internal successors, (66), 24 states have internal predecessors, (66), 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-12 18:23:20,534 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 439 transitions. [2022-07-12 18:23:20,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:23:20,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:20,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:20,547 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-12 18:23:20,744 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-12 18:23:20,744 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:20,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1267793515, now seen corresponding path program 1 times [2022-07-12 18:23:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:20,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130645111] [2022-07-12 18:23:20,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:20,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:20,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:20,746 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-12 18:23:20,747 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-12 18:23:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:20,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:23:20,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:23:20,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:23:20,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:20,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2130645111] [2022-07-12 18:23:20,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2130645111] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:20,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:20,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:23:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948705159] [2022-07-12 18:23:20,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:20,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:23:20,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:23:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:23:20,941 INFO L87 Difference]: Start difference. First operand 336 states and 439 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-12 18:23:21,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:21,212 INFO L93 Difference]: Finished difference Result 320 states and 404 transitions. [2022-07-12 18:23:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:23:21,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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 34 [2022-07-12 18:23:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:21,213 INFO L225 Difference]: With dead ends: 320 [2022-07-12 18:23:21,213 INFO L226 Difference]: Without dead ends: 320 [2022-07-12 18:23:21,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:23:21,214 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:21,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 149 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:23:21,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2022-07-12 18:23:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 309. [2022-07-12 18:23:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 300 states have (on average 1.31) internal successors, (393), 308 states have internal predecessors, (393), 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-12 18:23:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 393 transitions. [2022-07-12 18:23:21,219 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 393 transitions. Word has length 34 [2022-07-12 18:23:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:21,220 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 393 transitions. [2022-07-12 18:23:21,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 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-12 18:23:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 393 transitions. [2022-07-12 18:23:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 18:23:21,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:21,220 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:21,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:21,430 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-12 18:23:21,431 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:21,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 717604305, now seen corresponding path program 4 times [2022-07-12 18:23:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:21,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41730954] [2022-07-12 18:23:21,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:23:21,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:21,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:21,433 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-12 18:23:21,433 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-12 18:23:21,583 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:23:21,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:21,592 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-12 18:23:21,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:21,728 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-12 18:23:21,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2022-07-12 18:23:22,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2022-07-12 18:23:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:23:22,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:23,055 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:23:23,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:23,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41730954] [2022-07-12 18:23:23,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41730954] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:23,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:23,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2022-07-12 18:23:23,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689037247] [2022-07-12 18:23:23,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:23,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 18:23:23,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:23,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 18:23:23,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:23:23,058 INFO L87 Difference]: Start difference. First operand 309 states and 393 transitions. Second operand has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-12 18:23:27,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 18:23:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:30,652 INFO L93 Difference]: Finished difference Result 685 states and 891 transitions. [2022-07-12 18:23:30,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 18:23:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-12 18:23:30,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:30,655 INFO L225 Difference]: With dead ends: 685 [2022-07-12 18:23:30,655 INFO L226 Difference]: Without dead ends: 685 [2022-07-12 18:23:30,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=663, Invalid=2417, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 18:23:30,656 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1560 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:30,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 894 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-12 18:23:30,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-07-12 18:23:30,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 500. [2022-07-12 18:23:30,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 491 states have (on average 1.3441955193482689) internal successors, (660), 499 states have internal predecessors, (660), 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-12 18:23:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 660 transitions. [2022-07-12 18:23:30,665 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 660 transitions. Word has length 36 [2022-07-12 18:23:30,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:30,666 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 660 transitions. [2022-07-12 18:23:30,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.6) internal successors, (65), 25 states have internal predecessors, (65), 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-12 18:23:30,666 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 660 transitions. [2022-07-12 18:23:30,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:23:30,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:30,667 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:30,679 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-12 18:23:30,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:30,877 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:30,878 INFO L85 PathProgramCache]: Analyzing trace with hash -411523054, now seen corresponding path program 5 times [2022-07-12 18:23:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:30,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133513375] [2022-07-12 18:23:30,878 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:23:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:30,881 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:23:30,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-12 18:23:31,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-12 18:23:31,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:31,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:23:31,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:31,130 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 8 treesize of output 7 [2022-07-12 18:23:31,458 INFO L356 Elim1Store]: treesize reduction 50, result has 20.6 percent of original size [2022-07-12 18:23:31,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2022-07-12 18:23:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:31,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:34,083 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:34,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:34,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133513375] [2022-07-12 18:23:34,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133513375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:34,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:34,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2022-07-12 18:23:34,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075977691] [2022-07-12 18:23:34,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:34,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-12 18:23:34,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:34,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-12 18:23:34,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:23:34,086 INFO L87 Difference]: Start difference. First operand 500 states and 660 transitions. Second operand has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 30 states have internal predecessors, (78), 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-12 18:23:37,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:37,932 INFO L93 Difference]: Finished difference Result 543 states and 710 transitions. [2022-07-12 18:23:37,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 18:23:37,933 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 30 states have internal predecessors, (78), 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-12 18:23:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:37,934 INFO L225 Difference]: With dead ends: 543 [2022-07-12 18:23:37,934 INFO L226 Difference]: Without dead ends: 543 [2022-07-12 18:23:37,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=501, Invalid=1949, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 18:23:37,935 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 43 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:37,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 394 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 257 Unchecked, 0.1s Time] [2022-07-12 18:23:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-07-12 18:23:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 518. [2022-07-12 18:23:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 509 states have (on average 1.337917485265226) internal successors, (681), 517 states have internal predecessors, (681), 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-12 18:23:37,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 681 transitions. [2022-07-12 18:23:37,942 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 681 transitions. Word has length 40 [2022-07-12 18:23:37,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:37,943 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 681 transitions. [2022-07-12 18:23:37,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.689655172413793) internal successors, (78), 30 states have internal predecessors, (78), 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-12 18:23:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 681 transitions. [2022-07-12 18:23:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 18:23:37,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:37,944 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:37,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:38,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:38,155 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:38,155 INFO L85 PathProgramCache]: Analyzing trace with hash -282034220, now seen corresponding path program 6 times [2022-07-12 18:23:38,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:38,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228784474] [2022-07-12 18:23:38,155 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:23:38,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:38,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:38,156 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-12 18:23:38,157 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-12 18:23:38,328 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-12 18:23:38,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:38,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:23:38,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:38,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:23:38,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-07-12 18:23:38,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:23:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:23:38,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:39,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:23:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:23:40,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:40,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228784474] [2022-07-12 18:23:40,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228784474] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:40,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:40,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-07-12 18:23:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082260420] [2022-07-12 18:23:40,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:40,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:23:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:40,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:23:40,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:23:40,085 INFO L87 Difference]: Start difference. First operand 518 states and 681 transitions. Second operand has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 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-12 18:23:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:45,222 INFO L93 Difference]: Finished difference Result 941 states and 1246 transitions. [2022-07-12 18:23:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 18:23:45,223 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 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 40 [2022-07-12 18:23:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:45,225 INFO L225 Difference]: With dead ends: 941 [2022-07-12 18:23:45,225 INFO L226 Difference]: Without dead ends: 941 [2022-07-12 18:23:45,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=358, Invalid=902, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:23:45,226 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 876 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 147 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:45,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 552 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 757 Invalid, 0 Unknown, 147 Unchecked, 2.9s Time] [2022-07-12 18:23:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2022-07-12 18:23:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 699. [2022-07-12 18:23:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 690 states have (on average 1.3420289855072465) internal successors, (926), 698 states have internal predecessors, (926), 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-12 18:23:45,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 926 transitions. [2022-07-12 18:23:45,260 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 926 transitions. Word has length 40 [2022-07-12 18:23:45,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:45,260 INFO L495 AbstractCegarLoop]: Abstraction has 699 states and 926 transitions. [2022-07-12 18:23:45,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.176470588235294) internal successors, (54), 18 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-12 18:23:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 926 transitions. [2022-07-12 18:23:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 18:23:45,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:45,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:45,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:45,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:45,472 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:45,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:45,473 INFO L85 PathProgramCache]: Analyzing trace with hash 306205251, now seen corresponding path program 1 times [2022-07-12 18:23:45,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:45,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355931178] [2022-07-12 18:23:45,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:45,474 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:45,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:45,475 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:23:45,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-12 18:23:45,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:45,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 18:23:45,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:45,604 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 8 treesize of output 7 [2022-07-12 18:23:45,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 18:23:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 18:23:45,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:46,325 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 18:23:46,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:46,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355931178] [2022-07-12 18:23:46,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355931178] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:46,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:46,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-12 18:23:46,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522139210] [2022-07-12 18:23:46,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:46,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:23:46,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:46,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:23:46,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:23:46,327 INFO L87 Difference]: Start difference. First operand 699 states and 926 transitions. Second operand has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-12 18:23:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:47,390 INFO L93 Difference]: Finished difference Result 947 states and 1263 transitions. [2022-07-12 18:23:47,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:23:47,391 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2022-07-12 18:23:47,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:47,394 INFO L225 Difference]: With dead ends: 947 [2022-07-12 18:23:47,394 INFO L226 Difference]: Without dead ends: 947 [2022-07-12 18:23:47,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=311, Invalid=811, Unknown=0, NotChecked=0, Total=1122 [2022-07-12 18:23:47,395 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 764 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:47,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 386 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:23:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-07-12 18:23:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 858. [2022-07-12 18:23:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 849 states have (on average 1.3769140164899882) internal successors, (1169), 857 states have internal predecessors, (1169), 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-12 18:23:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1169 transitions. [2022-07-12 18:23:47,406 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1169 transitions. Word has length 44 [2022-07-12 18:23:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:47,406 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1169 transitions. [2022-07-12 18:23:47,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-12 18:23:47,407 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1169 transitions. [2022-07-12 18:23:47,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:23:47,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:47,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:47,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-12 18:23:47,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:47,617 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:47,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1599170913, now seen corresponding path program 1 times [2022-07-12 18:23:47,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:47,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455912073] [2022-07-12 18:23:47,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:47,620 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:23:47,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-12 18:23:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:47,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 18:23:47,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:47,758 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 8 treesize of output 7 [2022-07-12 18:23:47,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-07-12 18:23:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 18:23:48,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 18:23:48,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:48,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455912073] [2022-07-12 18:23:48,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455912073] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:48,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:48,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-12 18:23:48,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800958635] [2022-07-12 18:23:48,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:48,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:23:48,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:48,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:23:48,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:23:48,899 INFO L87 Difference]: Start difference. First operand 858 states and 1169 transitions. Second operand has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-12 18:23:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:51,023 INFO L93 Difference]: Finished difference Result 1289 states and 1744 transitions. [2022-07-12 18:23:51,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 18:23:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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 45 [2022-07-12 18:23:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:51,026 INFO L225 Difference]: With dead ends: 1289 [2022-07-12 18:23:51,026 INFO L226 Difference]: Without dead ends: 1289 [2022-07-12 18:23:51,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=392, Invalid=1330, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 18:23:51,027 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 895 mSDsluCounter, 707 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:51,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 791 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-12 18:23:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2022-07-12 18:23:51,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 872. [2022-07-12 18:23:51,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.3684820393974508) internal successors, (1181), 871 states have internal predecessors, (1181), 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-12 18:23:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1181 transitions. [2022-07-12 18:23:51,039 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1181 transitions. Word has length 45 [2022-07-12 18:23:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:51,040 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1181 transitions. [2022-07-12 18:23:51,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.0) internal successors, (72), 24 states have internal predecessors, (72), 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-12 18:23:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1181 transitions. [2022-07-12 18:23:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:23:51,041 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:51,041 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:51,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:51,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:51,252 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:51,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -484234273, now seen corresponding path program 2 times [2022-07-12 18:23:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848886340] [2022-07-12 18:23:51,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:23:51,254 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:51,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:51,255 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:23:51,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-12 18:23:51,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 18:23:51,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:51,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:23:51,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:51,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-12 18:23:51,402 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 8 treesize of output 7 [2022-07-12 18:23:51,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:23:51,567 INFO L356 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2022-07-12 18:23:51,567 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 2 case distinctions, treesize of input 19 treesize of output 27 [2022-07-12 18:23:51,580 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 18:23:51,580 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-12 18:23:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 18:23:51,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:54,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:23:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 18:23:56,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:56,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848886340] [2022-07-12 18:23:56,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848886340] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:56,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:56,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-12 18:23:56,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415323626] [2022-07-12 18:23:56,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:56,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:23:56,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:56,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:23:56,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2022-07-12 18:23:56,403 INFO L87 Difference]: Start difference. First operand 872 states and 1181 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:23:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:56,891 INFO L93 Difference]: Finished difference Result 873 states and 1169 transitions. [2022-07-12 18:23:56,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:23:56,892 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2022-07-12 18:23:56,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:56,894 INFO L225 Difference]: With dead ends: 873 [2022-07-12 18:23:56,894 INFO L226 Difference]: Without dead ends: 873 [2022-07-12 18:23:56,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=71, Invalid=200, Unknown=1, NotChecked=0, Total=272 [2022-07-12 18:23:56,895 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 74 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:56,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2022-07-12 18:23:56,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-12 18:23:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 872. [2022-07-12 18:23:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.354577056778679) internal successors, (1169), 871 states have internal predecessors, (1169), 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-12 18:23:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1169 transitions. [2022-07-12 18:23:56,905 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1169 transitions. Word has length 45 [2022-07-12 18:23:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:56,906 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1169 transitions. [2022-07-12 18:23:56,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:23:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1169 transitions. [2022-07-12 18:23:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:23:56,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:56,907 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:56,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:57,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:57,115 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:57,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2126360568, now seen corresponding path program 1 times [2022-07-12 18:23:57,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:57,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134425462] [2022-07-12 18:23:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:57,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:57,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:57,117 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:23:57,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-12 18:23:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:57,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:23:57,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 18:23:57,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:57,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2022-07-12 18:23:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-07-12 18:23:57,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:57,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134425462] [2022-07-12 18:23:57,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134425462] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:57,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:57,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-12 18:23:57,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354598803] [2022-07-12 18:23:57,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:57,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:23:57,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:57,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:23:57,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:23:57,834 INFO L87 Difference]: Start difference. First operand 872 states and 1169 transitions. Second operand has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 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-12 18:23:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:58,578 INFO L93 Difference]: Finished difference Result 1105 states and 1421 transitions. [2022-07-12 18:23:58,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:23:58,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 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 46 [2022-07-12 18:23:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:58,581 INFO L225 Difference]: With dead ends: 1105 [2022-07-12 18:23:58,581 INFO L226 Difference]: Without dead ends: 1105 [2022-07-12 18:23:58,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=336, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:23:58,582 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 489 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:58,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 163 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:23:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2022-07-12 18:23:58,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 872. [2022-07-12 18:23:58,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.320973348783314) internal successors, (1140), 871 states have internal predecessors, (1140), 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-12 18:23:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1140 transitions. [2022-07-12 18:23:58,592 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1140 transitions. Word has length 46 [2022-07-12 18:23:58,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:58,593 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1140 transitions. [2022-07-12 18:23:58,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.181818181818182) internal successors, (57), 12 states have internal predecessors, (57), 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-12 18:23:58,593 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1140 transitions. [2022-07-12 18:23:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:23:58,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:58,594 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:58,609 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:58,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:23:58,805 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:23:58,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:58,805 INFO L85 PathProgramCache]: Analyzing trace with hash -326352172, now seen corresponding path program 1 times [2022-07-12 18:23:58,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:23:58,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676718005] [2022-07-12 18:23:58,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:58,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:23:58,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:23:58,807 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:23:58,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-12 18:23:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:58,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-12 18:23:58,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:58,997 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-07-12 18:23:58,997 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-07-12 18:23:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:23:59,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-12 18:23:59,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:23:59,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676718005] [2022-07-12 18:23:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676718005] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:59,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:23:59,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2022-07-12 18:23:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727225926] [2022-07-12 18:23:59,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:59,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 18:23:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:23:59,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 18:23:59,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:23:59,956 INFO L87 Difference]: Start difference. First operand 872 states and 1140 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 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-12 18:24:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:00,198 INFO L93 Difference]: Finished difference Result 872 states and 1137 transitions. [2022-07-12 18:24:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:24:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 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 46 [2022-07-12 18:24:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:00,201 INFO L225 Difference]: With dead ends: 872 [2022-07-12 18:24:00,201 INFO L226 Difference]: Without dead ends: 872 [2022-07-12 18:24:00,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:24:00,201 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 44 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:00,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 148 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2022-07-12 18:24:00,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2022-07-12 18:24:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 872. [2022-07-12 18:24:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 863 states have (on average 1.3174971031286211) internal successors, (1137), 871 states have internal predecessors, (1137), 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-12 18:24:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1137 transitions. [2022-07-12 18:24:00,211 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1137 transitions. Word has length 46 [2022-07-12 18:24:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:00,211 INFO L495 AbstractCegarLoop]: Abstraction has 872 states and 1137 transitions. [2022-07-12 18:24:00,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 11 states have internal predecessors, (72), 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-12 18:24:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1137 transitions. [2022-07-12 18:24:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:24:00,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:00,212 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:00,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:00,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:24:00,423 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:24:00,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:00,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1349955383, now seen corresponding path program 1 times [2022-07-12 18:24:00,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:24:00,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466374595] [2022-07-12 18:24:00,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:00,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:24:00,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:24:00,424 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:24:00,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-12 18:24:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:00,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 18:24:00,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:07,166 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 18:24:07,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 18:24:07,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:24:07,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466374595] [2022-07-12 18:24:07,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466374595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:07,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:07,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:24:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966563887] [2022-07-12 18:24:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:07,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:24:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:24:07,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:24:07,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-12 18:24:07,168 INFO L87 Difference]: Start difference. First operand 872 states and 1137 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 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-12 18:24:07,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:07,203 INFO L93 Difference]: Finished difference Result 1104 states and 1443 transitions. [2022-07-12 18:24:07,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:24:07,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 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 50 [2022-07-12 18:24:07,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:07,207 INFO L225 Difference]: With dead ends: 1104 [2022-07-12 18:24:07,207 INFO L226 Difference]: Without dead ends: 1082 [2022-07-12 18:24:07,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13, Invalid=27, Unknown=2, NotChecked=0, Total=42 [2022-07-12 18:24:07,208 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 7 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:07,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 180 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 41 Unchecked, 0.0s Time] [2022-07-12 18:24:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1082 states. [2022-07-12 18:24:07,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1082 to 1007. [2022-07-12 18:24:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 998 states have (on average 1.3356713426853708) internal successors, (1333), 1006 states have internal predecessors, (1333), 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-12 18:24:07,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1333 transitions. [2022-07-12 18:24:07,220 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1333 transitions. Word has length 50 [2022-07-12 18:24:07,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:07,221 INFO L495 AbstractCegarLoop]: Abstraction has 1007 states and 1333 transitions. [2022-07-12 18:24:07,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 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-12 18:24:07,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1333 transitions. [2022-07-12 18:24:07,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 18:24:07,222 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:07,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:07,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-07-12 18:24:07,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:24:07,435 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:24:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1278180873, now seen corresponding path program 3 times [2022-07-12 18:24:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:24:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41830731] [2022-07-12 18:24:07,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:24:07,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:24:07,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:24:07,438 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:24:07,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-12 18:24:07,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-07-12 18:24:07,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:07,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:24:07,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 18:24:07,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:07,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:24:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-12 18:24:08,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:24:08,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41830731] [2022-07-12 18:24:08,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41830731] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:08,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:24:08,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-12 18:24:08,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831011118] [2022-07-12 18:24:08,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:08,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:24:08,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:24:08,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:24:08,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:24:08,270 INFO L87 Difference]: Start difference. First operand 1007 states and 1333 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 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-12 18:24:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:09,186 INFO L93 Difference]: Finished difference Result 1349 states and 1730 transitions. [2022-07-12 18:24:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:24:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-07-12 18:24:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:09,191 INFO L225 Difference]: With dead ends: 1349 [2022-07-12 18:24:09,191 INFO L226 Difference]: Without dead ends: 1349 [2022-07-12 18:24:09,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2022-07-12 18:24:09,192 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 373 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:09,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 181 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:24:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2022-07-12 18:24:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1006. [2022-07-12 18:24:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 998 states have (on average 1.2895791583166332) internal successors, (1287), 1005 states have internal predecessors, (1287), 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-12 18:24:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1287 transitions. [2022-07-12 18:24:09,204 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1287 transitions. Word has length 52 [2022-07-12 18:24:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:09,204 INFO L495 AbstractCegarLoop]: Abstraction has 1006 states and 1287 transitions. [2022-07-12 18:24:09,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 12 states have internal predecessors, (69), 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-12 18:24:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1287 transitions. [2022-07-12 18:24:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-12 18:24:09,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:09,206 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:09,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:09,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:24:09,415 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:24:09,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:09,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1986422419, now seen corresponding path program 1 times [2022-07-12 18:24:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:24:09,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371148414] [2022-07-12 18:24:09,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:09,416 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:24:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:24:09,417 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:24:09,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-12 18:24:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:09,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-12 18:24:09,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:09,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:24:09,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:09,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:09,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2022-07-12 18:24:09,738 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 58 treesize of output 54 [2022-07-12 18:24:09,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:09,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:09,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:09,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 30 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 91 [2022-07-12 18:24:09,936 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 85 treesize of output 73 [2022-07-12 18:24:10,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:10,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 115 treesize of output 51 [2022-07-12 18:24:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 18:24:10,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:11,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32))))) is different from false [2022-07-12 18:24:11,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 7 0) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv1 32)) ((_ extract 15 8) (_ bv1 32))) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 23 16) (_ bv1 32))) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 31 24) (_ bv1 32))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32))))) is different from false [2022-07-12 18:24:11,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 7 0) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv5 32)) ((_ extract 15 8) (_ bv1 32))) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) ((_ extract 23 16) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse1) ((_ extract 31 24) (_ bv1 32))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (_ bv1 32) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)))))) is different from false [2022-07-12 18:24:11,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1421 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1427 (Array (_ BitVec 32) (_ BitVec 8)))) (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1421))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 7 0) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv5 32)) ((_ extract 15 8) (_ bv1 32))) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) ((_ extract 23 16) (_ bv1 32))) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse2) ((_ extract 31 24) (_ bv1 32)))))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1427) |c_ULTIMATE.start_lis_~best~0#1.base|))) (bvslt (concat (concat (concat (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32))) (select .cse0 (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)))) (select .cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (bvadd (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|)) (_ bv1 32))))) is different from false [2022-07-12 18:24:11,268 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,269 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:11,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:11,424 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-12 18:24:11,424 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 1103 treesize of output 515 [2022-07-12 18:24:11,430 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 861 treesize of output 837 [2022-07-12 18:24:11,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,467 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,487 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,488 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,568 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,581 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,582 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,591 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,624 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,625 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,629 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,630 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,641 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 15393 treesize of output 11553 [2022-07-12 18:24:11,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,746 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,747 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,749 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,754 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 11951 treesize of output 11891 [2022-07-12 18:24:11,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,864 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,865 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,866 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,875 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,885 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,886 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,899 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,900 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,940 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:11,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,007 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,008 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,010 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,017 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,018 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,019 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,020 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,033 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,034 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,044 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,046 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,059 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:12,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:12,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 12 select indices, 12 select index equivalence classes, 58 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 8 case distinctions, treesize of input 15408 treesize of output 11657 [2022-07-12 18:24:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 5 not checked. [2022-07-12 18:24:14,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:24:14,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371148414] [2022-07-12 18:24:14,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371148414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:14,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:24:14,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2022-07-12 18:24:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728875831] [2022-07-12 18:24:14,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:14,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:24:14,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:24:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:24:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=292, Unknown=4, NotChecked=148, Total=506 [2022-07-12 18:24:14,984 INFO L87 Difference]: Start difference. First operand 1006 states and 1287 transitions. Second operand has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 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-12 18:24:18,387 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-12 18:24:19,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:19,768 INFO L93 Difference]: Finished difference Result 1071 states and 1349 transitions. [2022-07-12 18:24:19,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-12 18:24:19,768 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2022-07-12 18:24:19,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:19,771 INFO L225 Difference]: With dead ends: 1071 [2022-07-12 18:24:19,771 INFO L226 Difference]: Without dead ends: 1071 [2022-07-12 18:24:19,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=174, Invalid=650, Unknown=4, NotChecked=228, Total=1056 [2022-07-12 18:24:19,772 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 205 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 402 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:19,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 432 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 505 Invalid, 1 Unknown, 402 Unchecked, 3.2s Time] [2022-07-12 18:24:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2022-07-12 18:24:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 976. [2022-07-12 18:24:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 968 states have (on average 1.2882231404958677) internal successors, (1247), 975 states have internal predecessors, (1247), 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-12 18:24:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1247 transitions. [2022-07-12 18:24:19,781 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1247 transitions. Word has length 53 [2022-07-12 18:24:19,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:19,781 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1247 transitions. [2022-07-12 18:24:19,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.130434782608696) internal successors, (72), 23 states have internal predecessors, (72), 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-12 18:24:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1247 transitions. [2022-07-12 18:24:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:24:19,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:19,782 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:19,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Ended with exit code 0 [2022-07-12 18:24:19,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:24:19,983 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:24:19,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:19,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1956787805, now seen corresponding path program 1 times [2022-07-12 18:24:19,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:24:19,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562086099] [2022-07-12 18:24:19,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:19,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:24:19,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:24:19,985 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:24:19,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-12 18:24:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:20,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 18:24:20,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:20,195 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 18:24:20,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-12 18:24:20,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 18:24:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562086099] [2022-07-12 18:24:20,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562086099] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:20,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 18:24:20,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-12 18:24:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128866666] [2022-07-12 18:24:20,238 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:20,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:24:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 18:24:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:24:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:24:20,239 INFO L87 Difference]: Start difference. First operand 976 states and 1247 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-12 18:24:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:20,614 INFO L93 Difference]: Finished difference Result 1111 states and 1391 transitions. [2022-07-12 18:24:20,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:24:20,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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 55 [2022-07-12 18:24:20,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:20,618 INFO L225 Difference]: With dead ends: 1111 [2022-07-12 18:24:20,618 INFO L226 Difference]: Without dead ends: 1111 [2022-07-12 18:24:20,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:24:20,619 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 191 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:20,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 154 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:24:20,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2022-07-12 18:24:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1012. [2022-07-12 18:24:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 1004 states have (on average 1.2639442231075697) internal successors, (1269), 1011 states have internal predecessors, (1269), 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-12 18:24:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1269 transitions. [2022-07-12 18:24:20,628 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1269 transitions. Word has length 55 [2022-07-12 18:24:20,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:20,628 INFO L495 AbstractCegarLoop]: Abstraction has 1012 states and 1269 transitions. [2022-07-12 18:24:20,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 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-12 18:24:20,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1269 transitions. [2022-07-12 18:24:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 18:24:20,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:20,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:20,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:20,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 18:24:20,830 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-07-12 18:24:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1472253864, now seen corresponding path program 1 times [2022-07-12 18:24:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 18:24:20,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033560572] [2022-07-12 18:24:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:20,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 18:24:20,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 18:24:20,832 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 18:24:20,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-12 18:24:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:21,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:24:21,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:21,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-12 18:24:21,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:21,237 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:21,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 52 [2022-07-12 18:24:21,292 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 58 treesize of output 54 [2022-07-12 18:24:21,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 87 [2022-07-12 18:24:21,472 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 45 treesize of output 41 [2022-07-12 18:24:21,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:21,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 29 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 87 [2022-07-12 18:24:21,888 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 45 treesize of output 41 [2022-07-12 18:24:22,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:22,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 26 [2022-07-12 18:24:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-12 18:24:22,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:22,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse1 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1 (_ bv1 32)) v_ArrVal_1545) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) v_ArrVal_1547) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse1) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543)) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,428 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1537 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1541 (_ BitVec 8)) (v_ArrVal_1540 (_ BitVec 8)) (v_ArrVal_1539 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1539) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv1 32)) v_ArrVal_1541) (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1540) (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1537))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1537 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1541 (_ BitVec 8)) (v_ArrVal_1540 (_ BitVec 8)) (v_ArrVal_1539 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse2 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1539) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2 (_ bv5 32)) v_ArrVal_1541) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse2) v_ArrVal_1540) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse2) v_ArrVal_1537))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (_ BitVec 8)) (v_ArrVal_1546 (_ BitVec 8)) (v_ArrVal_1537 (_ BitVec 8)) (v_ArrVal_1543 (_ BitVec 8)) (v_ArrVal_1545 (_ BitVec 8)) (v_ArrVal_1542 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1541 (_ BitVec 8)) (v_ArrVal_1540 (_ BitVec 8)) (v_ArrVal_1536 (Array (_ BitVec 32) (_ BitVec 8))) (v_ArrVal_1539 (_ BitVec 8)) (v_ArrVal_1548 (Array (_ BitVec 32) (_ BitVec 8)))) (bvslt |c_ULTIMATE.start_lis_~max~0#1| (let ((.cse0 (select (store (let ((.cse1 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1536))) (store .cse2 |c_ULTIMATE.start_lis_~best~0#1.base| (let ((.cse3 (bvmul (_ bv4 32) |c_ULTIMATE.start_lis_~i~0#1|))) (store (store (store (store (select .cse2 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3) v_ArrVal_1539) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3 (_ bv5 32)) v_ArrVal_1541) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset| .cse3) v_ArrVal_1540) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32) .cse3) v_ArrVal_1537)))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1542))) (store .cse1 |c_ULTIMATE.start_lis_~best~0#1.base| (store (store (store (store (select .cse1 |c_ULTIMATE.start_lis_~best~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1546) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv5 32)) v_ArrVal_1545) (bvadd (_ bv6 32) |c_ULTIMATE.start_lis_~best~0#1.offset|) v_ArrVal_1547) (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv7 32)) v_ArrVal_1543))) |c_ULTIMATE.start_lis_~prev~0#1.base| v_ArrVal_1548) |c_ULTIMATE.start_lis_~best~0#1.base|))) (concat (concat (concat (select .cse0 (bvadd (_ bv3 32) |c_ULTIMATE.start_lis_~best~0#1.offset|)) (select .cse0 (bvadd (_ bv2 32) |c_ULTIMATE.start_lis_~best~0#1.offset|))) (select .cse0 (bvadd |c_ULTIMATE.start_lis_~best~0#1.offset| (_ bv1 32)))) (select .cse0 |c_ULTIMATE.start_lis_~best~0#1.offset|))))) is different from false [2022-07-12 18:24:22,523 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,524 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:22,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:24:22,666 INFO L356 Elim1Store]: treesize reduction 303, result has 14.6 percent of original size [2022-07-12 18:24:22,666 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 1151 treesize of output 563 [2022-07-12 18:24:22,675 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 569 treesize of output 553 [2022-07-12 18:24:22,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,711 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,721 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 715 treesize of output 603 [2022-07-12 18:24:22,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 859 treesize of output 803 [2022-07-12 18:24:22,770 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,772 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 803 treesize of output 775 [2022-07-12 18:24:22,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,795 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,809 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,815 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,818 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,822 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,823 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:24:22,862 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:22,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 24 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 4 case distinctions, treesize of input 718 treesize of output 636