./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test10-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 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:52:26,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:52:26,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:52:26,466 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:52:26,467 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:52:26,468 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:52:26,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:52:26,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:52:26,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:52:26,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:52:26,479 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:52:26,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:52:26,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:52:26,482 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:52:26,483 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:52:26,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:52:26,486 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:52:26,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:52:26,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:52:26,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:52:26,491 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:52:26,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:52:26,493 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:52:26,493 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:52:26,494 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:52:26,498 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:52:26,498 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:52:26,498 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:52:26,499 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:52:26,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:52:26,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:52:26,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:52:26,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:52:26,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:52:26,503 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:52:26,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:52:26,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:52:26,504 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:52:26,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:52:26,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:52:26,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:52:26,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:52:26,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:52:26,528 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:52:26,528 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:52:26,529 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:52:26,529 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:52:26,529 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:52:26,529 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:52:26,530 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:52:26,530 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:52:26,530 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:52:26,531 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:52:26,531 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:52:26,531 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:52:26,531 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:52:26,531 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:52:26,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:52:26,532 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:52:26,532 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:52:26,532 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:52:26,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:52:26,533 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:52:26,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:52:26,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:52:26,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:52:26,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:52:26,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:52:26,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:52:26,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:52:26,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:52:26,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:52:26,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:52:26,535 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 -> 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c [2022-07-20 05:52:26,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:52:26,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:52:26,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:52:26,702 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:52:26,702 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:52:26,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2022-07-20 05:52:26,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130f22077/9230c44e41c842119580eecefd847819/FLAG5f4f3b49a [2022-07-20 05:52:27,199 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:52:27,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2022-07-20 05:52:27,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130f22077/9230c44e41c842119580eecefd847819/FLAG5f4f3b49a [2022-07-20 05:52:27,230 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/130f22077/9230c44e41c842119580eecefd847819 [2022-07-20 05:52:27,232 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:52:27,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:52:27,234 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:52:27,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:52:27,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:52:27,237 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:52:27" (1/1) ... [2022-07-20 05:52:27,238 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ecb6a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:27, skipping insertion in model container [2022-07-20 05:52:27,238 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:52:27" (1/1) ... [2022-07-20 05:52:27,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:52:27,282 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:52:27,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:52:27,619 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2022-07-20 05:52:27,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42b6167 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:27, skipping insertion in model container [2022-07-20 05:52:27,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:52:27,621 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 05:52:27,623 INFO L158 Benchmark]: Toolchain (without parser) took 388.36ms. Allocated memory was 104.9MB in the beginning and 174.1MB in the end (delta: 69.2MB). Free memory was 75.2MB in the beginning and 143.7MB in the end (delta: -68.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:52:27,624 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 05:52:27,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.64ms. Allocated memory was 104.9MB in the beginning and 174.1MB in the end (delta: 69.2MB). Free memory was 74.9MB in the beginning and 143.7MB in the end (delta: -68.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-20 05:52:27,626 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.64ms. Allocated memory was 104.9MB in the beginning and 174.1MB in the end (delta: 69.2MB). Free memory was 74.9MB in the beginning and 143.7MB in the end (delta: -68.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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/ldv-memsafety/memleaks_test10-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 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:52:29,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:52:29,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:52:29,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:52:29,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:52:29,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:52:29,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:52:29,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:52:29,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:52:29,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:52:29,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:52:29,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:52:29,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:52:29,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:52:29,184 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:52:29,186 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:52:29,187 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:52:29,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:52:29,189 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:52:29,193 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:52:29,194 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:52:29,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:52:29,196 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:52:29,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:52:29,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:52:29,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:52:29,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:52:29,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:52:29,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:52:29,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:52:29,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:52:29,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:52:29,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:52:29,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:52:29,208 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:52:29,209 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:52:29,209 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:52:29,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:52:29,210 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:52:29,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:52:29,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:52:29,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:52:29,218 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 05:52:29,242 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:52:29,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:52:29,243 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:52:29,243 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:52:29,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:52:29,244 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:52:29,244 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:52:29,245 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:52:29,245 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:52:29,245 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:52:29,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:52:29,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:52:29,246 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:52:29,246 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:52:29,246 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:52:29,246 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:52:29,247 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:52:29,247 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:52:29,247 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:52:29,247 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:52:29,247 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 05:52:29,247 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 05:52:29,248 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:52:29,248 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:52:29,248 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:52:29,248 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:52:29,248 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:52:29,248 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:52:29,249 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:52:29,249 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:52:29,249 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 05:52:29,249 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 05:52:29,249 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 05:52:29,249 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 -> 207ea7efa81a205528159a2c1c5225b996f0eb4901bda418907cbc964f19b86c [2022-07-20 05:52:29,502 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:52:29,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:52:29,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:52:29,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:52:29,519 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:52:29,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2022-07-20 05:52:29,564 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5327423b7/54edfea4584b4399ae04f9132ac736c1/FLAG45be95986 [2022-07-20 05:52:30,031 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:52:30,031 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test10-1.i [2022-07-20 05:52:30,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5327423b7/54edfea4584b4399ae04f9132ac736c1/FLAG45be95986 [2022-07-20 05:52:30,066 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5327423b7/54edfea4584b4399ae04f9132ac736c1 [2022-07-20 05:52:30,068 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:52:30,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:52:30,071 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:52:30,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:52:30,073 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:52:30,074 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6863825b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30, skipping insertion in model container [2022-07-20 05:52:30,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:52:30,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:52:30,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:52:30,386 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 05:52:30,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:52:30,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:52:30,460 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:52:30,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:52:30,556 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:52:30,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30 WrapperNode [2022-07-20 05:52:30,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:52:30,558 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:52:30,558 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:52:30,558 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:52:30,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,598 INFO L137 Inliner]: procedures = 167, calls = 91, calls flagged for inlining = 22, calls inlined = 4, statements flattened = 66 [2022-07-20 05:52:30,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:52:30,599 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:52:30,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:52:30,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:52:30,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:52:30,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:52:30,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:52:30,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:52:30,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (1/1) ... [2022-07-20 05:52:30,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:52:30,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:52:30,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:52:30,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:52:30,741 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 05:52:30,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 05:52:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:52:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:52:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:52:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:52:30,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:52:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 05:52:30,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:52:30,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:52:30,818 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:52:30,819 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:52:31,062 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:52:31,067 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:52:31,067 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-20 05:52:31,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:52:31 BoogieIcfgContainer [2022-07-20 05:52:31,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:52:31,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:52:31,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:52:31,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:52:31,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:52:30" (1/3) ... [2022-07-20 05:52:31,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b37785e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:52:31, skipping insertion in model container [2022-07-20 05:52:31,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:52:30" (2/3) ... [2022-07-20 05:52:31,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b37785e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:52:31, skipping insertion in model container [2022-07-20 05:52:31,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:52:31" (3/3) ... [2022-07-20 05:52:31,074 INFO L111 eAbstractionObserver]: Analyzing ICFG memleaks_test10-1.i [2022-07-20 05:52:31,085 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:52:31,085 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-07-20 05:52:31,116 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:52:31,130 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@5943047a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@22356cb9 [2022-07-20 05:52:31,130 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-07-20 05:52:31,133 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:52:31,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:52:31,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:31,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:31,140 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:31,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:31,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1838783457, now seen corresponding path program 1 times [2022-07-20 05:52:31,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:31,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676325776] [2022-07-20 05:52:31,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:31,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:31,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:31,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:31,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 05:52:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:31,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:52:31,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:31,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:31,313 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:52:31,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:31,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676325776] [2022-07-20 05:52:31,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676325776] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:52:31,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:52:31,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:52:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969908294] [2022-07-20 05:52:31,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:52:31,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:52:31,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:31,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:52:31,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:52:31,347 INFO L87 Difference]: Start difference. First operand has 77 states, 37 states have (on average 2.027027027027027) internal successors, (75), 71 states have internal predecessors, (75), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:52:31,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:31,539 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2022-07-20 05:52:31,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:52:31,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-20 05:52:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:31,552 INFO L225 Difference]: With dead ends: 148 [2022-07-20 05:52:31,552 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 05:52:31,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:52:31,559 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 67 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:31,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 377 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:52:31,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 05:52:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 79. [2022-07-20 05:52:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-07-20 05:52:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-07-20 05:52:31,608 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 11 [2022-07-20 05:52:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:31,608 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-07-20 05:52:31,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:52:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-07-20 05:52:31,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:52:31,611 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:31,611 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:31,623 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-20 05:52:31,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:52:31,819 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:31,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1568680158, now seen corresponding path program 1 times [2022-07-20 05:52:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:31,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759377512] [2022-07-20 05:52:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:31,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:31,840 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:31,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 05:52:31,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:31,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:52:31,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:31,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:31,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:52:31,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:31,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759377512] [2022-07-20 05:52:31,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759377512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:52:31,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:52:31,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:52:31,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469864809] [2022-07-20 05:52:31,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:52:31,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:52:31,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:31,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:52:31,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:52:31,916 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:52:32,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:32,096 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2022-07-20 05:52:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:52:32,097 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-07-20 05:52:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:32,098 INFO L225 Difference]: With dead ends: 144 [2022-07-20 05:52:32,098 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 05:52:32,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:52:32,099 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 60 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:32,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 247 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:52:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 05:52:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 75. [2022-07-20 05:52:32,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 36 states have (on average 2.0) internal successors, (72), 69 states have internal predecessors, (72), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:52:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-07-20 05:52:32,105 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 11 [2022-07-20 05:52:32,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:32,105 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-07-20 05:52:32,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-20 05:52:32,105 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-07-20 05:52:32,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:52:32,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:32,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:32,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-20 05:52:32,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:52:32,333 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:32,333 INFO L85 PathProgramCache]: Analyzing trace with hash -27781040, now seen corresponding path program 1 times [2022-07-20 05:52:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:32,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015857268] [2022-07-20 05:52:32,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:32,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:32,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:32,335 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:32,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 05:52:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:32,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:52:32,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:32,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:52:32,465 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:52:32,466 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 12 treesize of output 17 [2022-07-20 05:52:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:32,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:32,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:32,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:32,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015857268] [2022-07-20 05:52:32,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015857268] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:32,633 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:52:32,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2022-07-20 05:52:32,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124248167] [2022-07-20 05:52:32,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:32,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:52:32,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:32,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:52:32,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:52:32,634 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:52:32,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:32,906 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2022-07-20 05:52:32,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:52:32,906 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 15 [2022-07-20 05:52:32,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:32,907 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:52:32,908 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:52:32,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:52:32,909 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 52 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 131 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:32,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 249 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 235 Invalid, 0 Unknown, 131 Unchecked, 0.2s Time] [2022-07-20 05:52:32,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:52:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-07-20 05:52:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 80 states have internal predecessors, (95), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-20 05:52:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2022-07-20 05:52:32,914 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 15 [2022-07-20 05:52:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:32,914 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2022-07-20 05:52:32,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:52:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2022-07-20 05:52:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:52:32,915 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:32,915 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:32,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:33,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:52:33,122 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:33,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:33,124 INFO L85 PathProgramCache]: Analyzing trace with hash -27781039, now seen corresponding path program 1 times [2022-07-20 05:52:33,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:33,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175860636] [2022-07-20 05:52:33,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:33,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:33,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:33,125 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:33,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 05:52:33,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:33,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:52:33,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:33,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:52:37,337 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:52:37,337 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 12 treesize of output 14 [2022-07-20 05:52:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:37,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:37,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175860636] [2022-07-20 05:52:37,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175860636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:37,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1605268057] [2022-07-20 05:52:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:52:37,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:52:37,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:52:37,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-07-20 05:52:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:37,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-20 05:52:37,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:37,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:52:37,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:52:45,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:52:45,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:52:45,864 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:52:45,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:52:45,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:45,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:48,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1605268057] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:48,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:52:48,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-20 05:52:48,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85935543] [2022-07-20 05:52:48,452 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:48,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 05:52:48,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:48,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 05:52:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=222, Unknown=7, NotChecked=0, Total=272 [2022-07-20 05:52:48,453 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 05:52:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:51,341 INFO L93 Difference]: Finished difference Result 148 states and 172 transitions. [2022-07-20 05:52:51,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:52:51,341 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2022-07-20 05:52:51,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:51,342 INFO L225 Difference]: With dead ends: 148 [2022-07-20 05:52:51,344 INFO L226 Difference]: Without dead ends: 148 [2022-07-20 05:52:51,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=56, Invalid=278, Unknown=8, NotChecked=0, Total=342 [2022-07-20 05:52:51,345 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 104 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:51,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 535 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 615 Invalid, 0 Unknown, 155 Unchecked, 0.8s Time] [2022-07-20 05:52:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-20 05:52:51,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 118. [2022-07-20 05:52:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.8311688311688312) internal successors, (141), 106 states have internal predecessors, (141), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (14), 10 states have call predecessors, (14), 7 states have call successors, (14) [2022-07-20 05:52:51,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 162 transitions. [2022-07-20 05:52:51,354 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 162 transitions. Word has length 15 [2022-07-20 05:52:51,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:51,355 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 162 transitions. [2022-07-20 05:52:51,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-20 05:52:51,355 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 162 transitions. [2022-07-20 05:52:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:52:51,356 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:51,356 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:51,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:51,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:51,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 05:52:51,756 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:51,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:51,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1824732399, now seen corresponding path program 1 times [2022-07-20 05:52:51,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:51,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370064325] [2022-07-20 05:52:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:51,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:51,759 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:51,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 05:52:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:51,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:52:51,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:51,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:51,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:52:51,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:51,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370064325] [2022-07-20 05:52:51,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370064325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:52:51,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:52:51,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:52:51,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309244128] [2022-07-20 05:52:51,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:52:51,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:52:51,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:51,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:52:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:52:51,873 INFO L87 Difference]: Start difference. First operand 118 states and 162 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:52:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:51,953 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-07-20 05:52:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:52:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2022-07-20 05:52:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:51,954 INFO L225 Difference]: With dead ends: 103 [2022-07-20 05:52:51,954 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:52:51,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:52:51,955 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:51,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:52:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:52:51,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-20 05:52:51,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 66 states have (on average 1.8333333333333333) internal successors, (121), 92 states have internal predecessors, (121), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-20 05:52:51,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 135 transitions. [2022-07-20 05:52:51,962 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 135 transitions. Word has length 15 [2022-07-20 05:52:51,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:51,962 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 135 transitions. [2022-07-20 05:52:51,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 05:52:51,962 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 135 transitions. [2022-07-20 05:52:51,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:52:51,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:51,963 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:51,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:52,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:52:52,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:52,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1259761877, now seen corresponding path program 1 times [2022-07-20 05:52:52,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:52,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323818889] [2022-07-20 05:52:52,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:52,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:52,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:52,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:52,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 05:52:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:52,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 05:52:52,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:52,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:52:52,266 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:52:52,276 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:52:52,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:52:52,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:52,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323818889] [2022-07-20 05:52:52,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323818889] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:52:52,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:52:52,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:52:52,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066140700] [2022-07-20 05:52:52,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:52:52,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:52:52,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:52,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:52:52,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:52:52,278 INFO L87 Difference]: Start difference. First operand 101 states and 135 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:52:52,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:52,428 INFO L93 Difference]: Finished difference Result 111 states and 149 transitions. [2022-07-20 05:52:52,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:52:52,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-07-20 05:52:52,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:52,429 INFO L225 Difference]: With dead ends: 111 [2022-07-20 05:52:52,429 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:52:52,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:52:52,430 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 5 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 325 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.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:52,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 325 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:52:52,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:52:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-07-20 05:52:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 95 states have internal predecessors, (125), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-20 05:52:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 139 transitions. [2022-07-20 05:52:52,435 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 139 transitions. Word has length 20 [2022-07-20 05:52:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:52,436 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 139 transitions. [2022-07-20 05:52:52,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 05:52:52,436 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 139 transitions. [2022-07-20 05:52:52,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 05:52:52,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:52,436 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:52,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 05:52:52,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:52:52,643 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:52,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1227750956, now seen corresponding path program 1 times [2022-07-20 05:52:52,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:52,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397567899] [2022-07-20 05:52:52,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:52,644 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:52,645 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:52:52,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 05:52:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:52,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 05:52:52,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:52:52,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:52:52,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:52,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397567899] [2022-07-20 05:52:52,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397567899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:52:52,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:52:52,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2022-07-20 05:52:52,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450915975] [2022-07-20 05:52:52,912 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:52:52,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:52:52,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:52:52,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:52:52,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:52:52,913 INFO L87 Difference]: Start difference. First operand 105 states and 139 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:52:53,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:52:53,155 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2022-07-20 05:52:53,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:52:53,156 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 20 [2022-07-20 05:52:53,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:52:53,156 INFO L225 Difference]: With dead ends: 108 [2022-07-20 05:52:53,157 INFO L226 Difference]: Without dead ends: 108 [2022-07-20 05:52:53,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:52:53,157 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 120 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:52:53,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 189 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-20 05:52:53,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-20 05:52:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-07-20 05:52:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.7397260273972603) internal successors, (127), 97 states have internal predecessors, (127), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-20 05:52:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 141 transitions. [2022-07-20 05:52:53,161 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 141 transitions. Word has length 20 [2022-07-20 05:52:53,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:52:53,161 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 141 transitions. [2022-07-20 05:52:53,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:52:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 141 transitions. [2022-07-20 05:52:53,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:52:53,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:52:53,162 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:52:53,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-20 05:52:53,368 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-20 05:52:53,368 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:52:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:52:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash -12644306, now seen corresponding path program 1 times [2022-07-20 05:52:53,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:52:53,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813660313] [2022-07-20 05:52:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:53,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:52:53,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:52:53,370 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-20 05:52:53,371 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-20 05:52:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:53,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:52:53,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:53,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:52:53,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:52:57,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:52:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813660313] [2022-07-20 05:52:57,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813660313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:52:57,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1294777252] [2022-07-20 05:52:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:52:57,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:52:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:52:57,832 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:52:57,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-07-20 05:52:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:52:57,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:52:57,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:52:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:52:58,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:02,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1294777252] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:02,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:02,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-07-20 05:53:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233881299] [2022-07-20 05:53:02,259 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:02,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:53:02,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:02,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:53:02,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=166, Unknown=2, NotChecked=0, Total=210 [2022-07-20 05:53:02,260 INFO L87 Difference]: Start difference. First operand 108 states and 141 transitions. Second operand has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:53:02,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:02,419 INFO L93 Difference]: Finished difference Result 118 states and 151 transitions. [2022-07-20 05:53:02,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:53:02,420 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-07-20 05:53:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:02,421 INFO L225 Difference]: With dead ends: 118 [2022-07-20 05:53:02,421 INFO L226 Difference]: Without dead ends: 111 [2022-07-20 05:53:02,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=50, Invalid=220, Unknown=2, NotChecked=0, Total=272 [2022-07-20 05:53:02,421 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:02,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 311 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 191 Unchecked, 0.1s Time] [2022-07-20 05:53:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-20 05:53:02,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-07-20 05:53:02,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 94 states have internal predecessors, (122), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (9), 7 states have call predecessors, (9), 5 states have call successors, (9) [2022-07-20 05:53:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 136 transitions. [2022-07-20 05:53:02,426 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 136 transitions. Word has length 23 [2022-07-20 05:53:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:02,426 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 136 transitions. [2022-07-20 05:53:02,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-20 05:53:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 136 transitions. [2022-07-20 05:53:02,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:53:02,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:02,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:02,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:02,635 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-20 05:53:02,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:02,829 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1738347476, now seen corresponding path program 1 times [2022-07-20 05:53:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:02,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082849760] [2022-07-20 05:53:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:02,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:02,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:02,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:53:02,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 05:53:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:02,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:53:02,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:02,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:02,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:02,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:53:03,024 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:53:03,024 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 12 treesize of output 17 [2022-07-20 05:53:03,037 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:53:03,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:53:03,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:03,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082849760] [2022-07-20 05:53:03,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082849760] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:03,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:03,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2022-07-20 05:53:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561247480] [2022-07-20 05:53:03,171 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:03,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:53:03,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:03,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:53:03,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:53:03,171 INFO L87 Difference]: Start difference. First operand 105 states and 136 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 05:53:03,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:03,467 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-07-20 05:53:03,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:53:03,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2022-07-20 05:53:03,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:03,468 INFO L225 Difference]: With dead ends: 115 [2022-07-20 05:53:03,468 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 05:53:03,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:53:03,469 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 7 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:03,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 300 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2022-07-20 05:53:03,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 05:53:03,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-07-20 05:53:03,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 99 states have internal predecessors, (131), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-20 05:53:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 148 transitions. [2022-07-20 05:53:03,483 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 148 transitions. Word has length 25 [2022-07-20 05:53:03,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:03,483 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 148 transitions. [2022-07-20 05:53:03,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 05:53:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 148 transitions. [2022-07-20 05:53:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:53:03,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:03,484 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:03,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:03,688 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-20 05:53:03,688 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:03,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:03,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1738347475, now seen corresponding path program 1 times [2022-07-20 05:53:03,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:03,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769269938] [2022-07-20 05:53:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:03,689 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:03,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:03,690 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-20 05:53:03,692 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-20 05:53:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:03,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 05:53:03,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:03,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:03,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:03,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:03,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:53:03,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:07,968 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:53:07,969 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 12 treesize of output 14 [2022-07-20 05:53:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:53:07,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:08,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:08,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769269938] [2022-07-20 05:53:08,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769269938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:08,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1971134673] [2022-07-20 05:53:08,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:08,208 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:08,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:53:08,209 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:53:08,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-07-20 05:53:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:08,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:53:08,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:08,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:08,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:08,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:08,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:08,469 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 26 treesize of output 14 [2022-07-20 05:53:08,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:12,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:53:12,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:12,653 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:12,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:12,658 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:53:12,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:15,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1971134673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:15,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:15,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-07-20 05:53:15,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029486998] [2022-07-20 05:53:15,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:15,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:53:15,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:15,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:53:15,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=289, Unknown=5, NotChecked=0, Total=342 [2022-07-20 05:53:15,396 INFO L87 Difference]: Start difference. First operand 113 states and 148 transitions. Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:53:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:18,072 INFO L93 Difference]: Finished difference Result 115 states and 148 transitions. [2022-07-20 05:53:18,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:53:18,072 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 25 [2022-07-20 05:53:18,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:18,073 INFO L225 Difference]: With dead ends: 115 [2022-07-20 05:53:18,073 INFO L226 Difference]: Without dead ends: 115 [2022-07-20 05:53:18,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=76, Invalid=424, Unknown=6, NotChecked=0, Total=506 [2022-07-20 05:53:18,074 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 11 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:18,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 491 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 311 Invalid, 0 Unknown, 74 Unchecked, 0.5s Time] [2022-07-20 05:53:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-20 05:53:18,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2022-07-20 05:53:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.6973684210526316) internal successors, (129), 99 states have internal predecessors, (129), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-20 05:53:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2022-07-20 05:53:18,077 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 25 [2022-07-20 05:53:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:18,077 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2022-07-20 05:53:18,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 13 states have internal predecessors, (29), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-20 05:53:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2022-07-20 05:53:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:53:18,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:18,078 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:18,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:18,286 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-20 05:53:18,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:18,480 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:18,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2051061195, now seen corresponding path program 1 times [2022-07-20 05:53:18,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:18,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879876846] [2022-07-20 05:53:18,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:18,482 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-20 05:53:18,483 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-20 05:53:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:18,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 05:53:18,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:18,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:18,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:18,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:18,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:53:18,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:18,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:18,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879876846] [2022-07-20 05:53:18,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879876846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:18,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:18,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:53:18,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157191315] [2022-07-20 05:53:18,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:18,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:53:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:18,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:53:18,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:53:18,618 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:53:18,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:18,747 INFO L93 Difference]: Finished difference Result 107 states and 135 transitions. [2022-07-20 05:53:18,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:53:18,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-07-20 05:53:18,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:18,748 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:53:18,748 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 05:53:18,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:53:18,749 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 2 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:18,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 327 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:53:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 05:53:18,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-07-20 05:53:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 90 states have internal predecessors, (116), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 05:53:18,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2022-07-20 05:53:18,752 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 25 [2022-07-20 05:53:18,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:18,753 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2022-07-20 05:53:18,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:53:18,753 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2022-07-20 05:53:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:53:18,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:18,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:18,762 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-20 05:53:18,960 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-20 05:53:18,960 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:18,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:18,960 INFO L85 PathProgramCache]: Analyzing trace with hash 190353901, now seen corresponding path program 1 times [2022-07-20 05:53:18,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:18,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225428106] [2022-07-20 05:53:18,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:18,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:18,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:18,963 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:53:18,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 05:53:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:19,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:53:19,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:19,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:19,085 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:53:19,086 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 12 treesize of output 17 [2022-07-20 05:53:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:53:19,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:19,096 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:19,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225428106] [2022-07-20 05:53:19,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [225428106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:19,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:19,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:53:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793810599] [2022-07-20 05:53:19,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:19,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:53:19,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:19,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:53:19,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:53:19,097 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:53:19,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:19,257 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2022-07-20 05:53:19,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:53:19,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-07-20 05:53:19,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:19,258 INFO L225 Difference]: With dead ends: 104 [2022-07-20 05:53:19,258 INFO L226 Difference]: Without dead ends: 104 [2022-07-20 05:53:19,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:53:19,259 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:19,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 124 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 84 Invalid, 0 Unknown, 49 Unchecked, 0.2s Time] [2022-07-20 05:53:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-20 05:53:19,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2022-07-20 05:53:19,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 68 states have (on average 1.6911764705882353) internal successors, (115), 89 states have internal predecessors, (115), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 05:53:19,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2022-07-20 05:53:19,262 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 27 [2022-07-20 05:53:19,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:19,262 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2022-07-20 05:53:19,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-20 05:53:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2022-07-20 05:53:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 05:53:19,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:19,263 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:19,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:19,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:19,470 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:19,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:19,470 INFO L85 PathProgramCache]: Analyzing trace with hash 190353902, now seen corresponding path program 1 times [2022-07-20 05:53:19,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:19,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [933849457] [2022-07-20 05:53:19,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:19,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:19,472 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:53:19,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 05:53:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:19,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 05:53:19,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:19,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:19,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:19,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:53:19,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:19,728 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:19,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:19,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:53:19,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:19,853 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:19,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:53:19,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:22,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:22,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [933849457] [2022-07-20 05:53:22,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [933849457] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:22,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1076273184] [2022-07-20 05:53:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:22,146 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:22,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:53:22,147 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:53:22,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2022-07-20 05:53:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:22,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:53:22,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:22,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:22,272 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:22,358 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:22,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:22,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:22,403 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:22,470 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 8 treesize of output 4 [2022-07-20 05:53:24,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:53:24,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:53:24,569 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:24,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:53:24,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:26,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1076273184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:26,859 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:26,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 11 [2022-07-20 05:53:26,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802026426] [2022-07-20 05:53:26,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:26,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:53:26,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:26,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:53:26,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=147, Unknown=1, NotChecked=0, Total=182 [2022-07-20 05:53:26,860 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 05:53:27,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:27,394 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2022-07-20 05:53:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:53:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-07-20 05:53:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:27,395 INFO L225 Difference]: With dead ends: 125 [2022-07-20 05:53:27,395 INFO L226 Difference]: Without dead ends: 125 [2022-07-20 05:53:27,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=60, Invalid=245, Unknown=1, NotChecked=0, Total=306 [2022-07-20 05:53:27,396 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 87 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:27,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 342 Invalid, 0 Unknown, 53 Unchecked, 0.5s Time] [2022-07-20 05:53:27,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-20 05:53:27,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 86. [2022-07-20 05:53:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.625) internal successors, (91), 77 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:53:27,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2022-07-20 05:53:27,399 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 27 [2022-07-20 05:53:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:27,399 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2022-07-20 05:53:27,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-20 05:53:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2022-07-20 05:53:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:53:27,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:27,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:27,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:27,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2022-07-20 05:53:27,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:27,810 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:27,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:27,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1606003645, now seen corresponding path program 1 times [2022-07-20 05:53:27,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:27,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674892738] [2022-07-20 05:53:27,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:27,811 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:27,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:27,812 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-20 05:53:27,813 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-20 05:53:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:27,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-20 05:53:27,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:27,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:27,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:27,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:28,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:28,077 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-20 05:53:28,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 27 [2022-07-20 05:53:28,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:53:28,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2022-07-20 05:53:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:53:28,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:28,279 INFO L356 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2022-07-20 05:53:28,279 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 68 treesize of output 67 [2022-07-20 05:53:28,337 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:28,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674892738] [2022-07-20 05:53:28,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674892738] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:28,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1799959808] [2022-07-20 05:53:28,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:28,337 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:53:28,339 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:53:28,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2022-07-20 05:53:28,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:28,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:53:28,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:28,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:28,538 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:28,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:28,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:30,631 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_18|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_9|)))) is different from true [2022-07-20 05:53:30,705 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:53:30,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 05:53:30,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:53:30,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 05:53:30,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:30,802 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-20 05:53:30,803 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 22 treesize of output 21 [2022-07-20 05:53:30,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_270 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_270) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_#t~mem47#1.base|)) is different from false [2022-07-20 05:53:30,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1799959808] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:30,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:30,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2022-07-20 05:53:30,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794746631] [2022-07-20 05:53:30,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:30,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:53:30,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:30,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:53:30,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=450, Unknown=2, NotChecked=86, Total=600 [2022-07-20 05:53:30,818 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 05:53:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:42,616 INFO L93 Difference]: Finished difference Result 138 states and 151 transitions. [2022-07-20 05:53:42,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:53:42,617 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 28 [2022-07-20 05:53:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:42,618 INFO L225 Difference]: With dead ends: 138 [2022-07-20 05:53:42,618 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 05:53:42,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=250, Invalid=1559, Unknown=5, NotChecked=166, Total=1980 [2022-07-20 05:53:42,619 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 180 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:42,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 611 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 925 Invalid, 0 Unknown, 119 Unchecked, 1.1s Time] [2022-07-20 05:53:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 05:53:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 84. [2022-07-20 05:53:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 74 states have internal predecessors, (86), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2022-07-20 05:53:42,622 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 28 [2022-07-20 05:53:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:42,622 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2022-07-20 05:53:42,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.7894736842105263) internal successors, (34), 16 states have internal predecessors, (34), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 05:53:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2022-07-20 05:53:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 05:53:42,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:42,623 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:42,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2022-07-20 05:53:42,832 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-20 05:53:43,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:43,025 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:43,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:43,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1606003646, now seen corresponding path program 1 times [2022-07-20 05:53:43,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:43,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155183032] [2022-07-20 05:53:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:43,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:43,027 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-20 05:53:43,029 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-20 05:53:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:43,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:53:43,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:43,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:43,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:43,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:43,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:43,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:43,399 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:53:43,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 05:53:43,403 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 33 treesize of output 33 [2022-07-20 05:53:43,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-20 05:53:43,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-20 05:53:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:53:43,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:43,668 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:53:43,668 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 50 treesize of output 54 [2022-07-20 05:53:43,773 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_295 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_295) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) (and (or (and .cse0 (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_1) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32)))) (forall ((v_ArrVal_294 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_294) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_#t~mem47#1.base|))) .cse0 (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_1) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset|))))) is different from false [2022-07-20 05:53:43,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:43,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155183032] [2022-07-20 05:53:43,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155183032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:43,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2046784037] [2022-07-20 05:53:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:53:43,812 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:53:43,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2022-07-20 05:53:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:43,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 05:53:43,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:43,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:43,966 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:43,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:43,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:43,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:44,146 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:53:44,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-07-20 05:53:44,151 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 33 treesize of output 33 [2022-07-20 05:53:44,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-07-20 05:53:44,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-07-20 05:53:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:53:44,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:44,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:53:44,278 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 50 treesize of output 54 [2022-07-20 05:53:44,365 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_prenex_4) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_320 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_320) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset|))) (or (forall ((v_ArrVal_319 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_319) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_#t~mem47#1.base|)) (forall ((v_ArrVal_320 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_320) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))))) is different from false [2022-07-20 05:53:44,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2046784037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:44,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:44,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2022-07-20 05:53:44,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51194155] [2022-07-20 05:53:44,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:44,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:53:44,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:44,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:53:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=178, Unknown=2, NotChecked=54, Total=272 [2022-07-20 05:53:44,409 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:53:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:44,914 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-07-20 05:53:44,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:53:44,915 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2022-07-20 05:53:44,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:44,915 INFO L225 Difference]: With dead ends: 93 [2022-07-20 05:53:44,915 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 05:53:44,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=422, Unknown=2, NotChecked=86, Total=600 [2022-07-20 05:53:44,917 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 78 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:44,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 279 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 266 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2022-07-20 05:53:44,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 05:53:44,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2022-07-20 05:53:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 55 states have (on average 1.5454545454545454) internal successors, (85), 73 states have internal predecessors, (85), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 94 transitions. [2022-07-20 05:53:44,920 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 94 transitions. Word has length 28 [2022-07-20 05:53:44,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:44,920 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 94 transitions. [2022-07-20 05:53:44,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:53:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 94 transitions. [2022-07-20 05:53:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:53:44,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:44,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:44,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2022-07-20 05:53:45,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-20 05:53:45,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:45,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:45,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1476244126, now seen corresponding path program 1 times [2022-07-20 05:53:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:45,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786658635] [2022-07-20 05:53:45,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:45,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:45,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:45,325 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 05:53:45,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 05:53:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:45,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:53:45,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:45,404 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-20 05:53:45,404 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:45,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:45,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786658635] [2022-07-20 05:53:45,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786658635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:45,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:45,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:53:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665162201] [2022-07-20 05:53:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:45,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:53:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:45,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:53:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:53:45,405 INFO L87 Difference]: Start difference. First operand 83 states and 94 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:45,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:45,488 INFO L93 Difference]: Finished difference Result 82 states and 93 transitions. [2022-07-20 05:53:45,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:53:45,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-07-20 05:53:45,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:45,489 INFO L225 Difference]: With dead ends: 82 [2022-07-20 05:53:45,489 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 05:53:45,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-20 05:53:45,489 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 30 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:45,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 93 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:53:45,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 05:53:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-20 05:53:45,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 55 states have (on average 1.5272727272727273) internal successors, (84), 72 states have internal predecessors, (84), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2022-07-20 05:53:45,491 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 30 [2022-07-20 05:53:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:45,492 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2022-07-20 05:53:45,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:45,492 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2022-07-20 05:53:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:53:45,492 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:45,492 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:45,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-20 05:53:45,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:45,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:45,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1476244127, now seen corresponding path program 1 times [2022-07-20 05:53:45,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:45,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183272257] [2022-07-20 05:53:45,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:45,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:45,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:45,701 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-20 05:53:45,702 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-20 05:53:45,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:45,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 05:53:45,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:53:45,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:45,941 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 8 treesize of output 6 [2022-07-20 05:53:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-20 05:53:46,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:46,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183272257] [2022-07-20 05:53:46,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183272257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:53:46,065 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:46,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2022-07-20 05:53:46,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601899160] [2022-07-20 05:53:46,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:46,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:53:46,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:46,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:53:46,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:53:46,067 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 05:53:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:46,391 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2022-07-20 05:53:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:53:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-07-20 05:53:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:46,392 INFO L225 Difference]: With dead ends: 80 [2022-07-20 05:53:46,392 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 05:53:46,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:53:46,393 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 118 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 232 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-20 05:53:46,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 232 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:53:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 05:53:46,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-07-20 05:53:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.42) internal successors, (71), 65 states have internal predecessors, (71), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-07-20 05:53:46,395 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 30 [2022-07-20 05:53:46,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:46,395 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-07-20 05:53:46,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-20 05:53:46,395 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-07-20 05:53:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:53:46,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:46,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:46,405 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-20 05:53:46,596 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-20 05:53:46,596 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1481073420, now seen corresponding path program 1 times [2022-07-20 05:53:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:46,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935869824] [2022-07-20 05:53:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:46,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:46,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:46,598 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-20 05:53:46,600 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-20 05:53:46,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:46,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:53:46,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:46,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:46,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:46,750 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 7 treesize of output 3 [2022-07-20 05:53:46,872 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 05:53:46,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 21 [2022-07-20 05:53:46,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:53:46,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:46,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935869824] [2022-07-20 05:53:46,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935869824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:46,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:46,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 05:53:46,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471339623] [2022-07-20 05:53:46,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:46,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 05:53:46,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:46,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 05:53:46,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:53:46,916 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:53:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:47,160 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-07-20 05:53:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:53:47,160 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-07-20 05:53:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:47,161 INFO L225 Difference]: With dead ends: 130 [2022-07-20 05:53:47,161 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 05:53:47,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-07-20 05:53:47,161 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 73 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:47,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 516 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 24 Unchecked, 0.2s Time] [2022-07-20 05:53:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 05:53:47,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 84. [2022-07-20 05:53:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 73 states have internal predecessors, (80), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:53:47,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-07-20 05:53:47,164 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 31 [2022-07-20 05:53:47,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:47,164 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-07-20 05:53:47,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:53:47,164 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-07-20 05:53:47,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:53:47,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:47,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:47,175 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-20 05:53:47,372 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-20 05:53:47,372 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:47,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:47,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1481072329, now seen corresponding path program 1 times [2022-07-20 05:53:47,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:47,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1185752918] [2022-07-20 05:53:47,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:47,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:47,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:47,374 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-20 05:53:47,374 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-20 05:53:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:47,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 05:53:47,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:47,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:53:47,470 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-20 05:53:47,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:47,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:47,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1185752918] [2022-07-20 05:53:47,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1185752918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:47,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:47,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:53:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946559965] [2022-07-20 05:53:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:47,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:53:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:53:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:53:47,472 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:47,634 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-07-20 05:53:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:53:47,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-20 05:53:47,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:47,635 INFO L225 Difference]: With dead ends: 89 [2022-07-20 05:53:47,635 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 05:53:47,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:53:47,636 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:47,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 170 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:53:47,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 05:53:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2022-07-20 05:53:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 72 states have internal predecessors, (79), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:53:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-07-20 05:53:47,638 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 31 [2022-07-20 05:53:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:47,639 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-07-20 05:53:47,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-07-20 05:53:47,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:53:47,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:47,639 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:47,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:47,846 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-20 05:53:47,847 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:47,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1481072328, now seen corresponding path program 1 times [2022-07-20 05:53:47,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:47,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340748247] [2022-07-20 05:53:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:47,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:47,849 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-20 05:53:47,850 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-20 05:53:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:47,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 05:53:47,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:48,011 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 23 treesize of output 15 [2022-07-20 05:53:48,014 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 32 treesize of output 16 [2022-07-20 05:53:48,050 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-20 05:53:48,051 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:48,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:48,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340748247] [2022-07-20 05:53:48,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340748247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:48,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:48,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:53:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664427137] [2022-07-20 05:53:48,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:48,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:53:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:48,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:53:48,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:53:48,052 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:48,524 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2022-07-20 05:53:48,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:53:48,524 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-07-20 05:53:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:48,525 INFO L225 Difference]: With dead ends: 95 [2022-07-20 05:53:48,525 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 05:53:48,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:53:48,526 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:48,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 185 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:53:48,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 05:53:48,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2022-07-20 05:53:48,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 71 states have internal predecessors, (78), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:53:48,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-07-20 05:53:48,528 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 31 [2022-07-20 05:53:48,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:48,528 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-07-20 05:53:48,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:48,529 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-07-20 05:53:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:53:48,529 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:48,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:48,538 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-20 05:53:48,733 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-20 05:53:48,734 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:48,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:48,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1677586925, now seen corresponding path program 1 times [2022-07-20 05:53:48,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:48,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510832015] [2022-07-20 05:53:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:48,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:48,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:48,735 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-20 05:53:48,739 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-20 05:53:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:48,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 05:53:48,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:48,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:48,877 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:48,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:48,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:48,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:48,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:53:49,065 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 14 treesize of output 16 [2022-07-20 05:53:49,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:53:49,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:49,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_438 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_438) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 05:53:49,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:49,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [510832015] [2022-07-20 05:53:49,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [510832015] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:49,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [23774932] [2022-07-20 05:53:49,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:49,142 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:49,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:53:49,144 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:53:49,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2022-07-20 05:53:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:49,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:53:49,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:49,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:49,305 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:49,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:49,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:49,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:49,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:53:49,433 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 14 treesize of output 16 [2022-07-20 05:53:49,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:53:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:53:49,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:49,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_460) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 05:53:49,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [23774932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:49,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:49,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2022-07-20 05:53:49,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966936010] [2022-07-20 05:53:49,483 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:49,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 05:53:49,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:49,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 05:53:49,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=130, Unknown=2, NotChecked=46, Total=210 [2022-07-20 05:53:49,483 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:53:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:50,102 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-07-20 05:53:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 05:53:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-07-20 05:53:50,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:50,103 INFO L225 Difference]: With dead ends: 91 [2022-07-20 05:53:50,103 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 05:53:50,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=344, Unknown=2, NotChecked=78, Total=506 [2022-07-20 05:53:50,104 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 62 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:50,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 299 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 343 Invalid, 0 Unknown, 40 Unchecked, 0.4s Time] [2022-07-20 05:53:50,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 05:53:50,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2022-07-20 05:53:50,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 64 states have internal predecessors, (70), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:50,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-07-20 05:53:50,106 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 31 [2022-07-20 05:53:50,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:50,107 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-07-20 05:53:50,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-20 05:53:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-07-20 05:53:50,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 05:53:50,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:50,107 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:50,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:50,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-20 05:53:50,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:53:50,510 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1331364346, now seen corresponding path program 1 times [2022-07-20 05:53:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:50,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [271187458] [2022-07-20 05:53:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:50,512 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-20 05:53:50,513 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-20 05:53:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:50,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 05:53:50,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:50,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:50,632 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:50,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:50,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:52,687 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_20| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_20|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_29|))) is different from true [2022-07-20 05:53:54,806 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-20 05:53:54,807 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-07-20 05:53:54,811 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 27 treesize of output 29 [2022-07-20 05:53:54,860 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 24 treesize of output 16 [2022-07-20 05:53:54,912 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 05:53:54,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2022-07-20 05:53:54,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:53:54,935 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:55,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |c_ULTIMATE.start_entry_point_#t~ret48#1.base|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_483) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32)))) is different from false [2022-07-20 05:53:55,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret48#1.base_41| (_ BitVec 32))) (or (forall ((v_ArrVal_483 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_41|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_483) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)) (_ bv0 32)))) (= |v_ULTIMATE.start_entry_point_#t~ret48#1.base_41| (_ bv0 32)))) is different from false [2022-07-20 05:53:55,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:55,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [271187458] [2022-07-20 05:53:55,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [271187458] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:55,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [592045918] [2022-07-20 05:53:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:55,042 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:53:55,043 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:53:55,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process [2022-07-20 05:53:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:55,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:53:55,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:55,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:55,232 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:55,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:55,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:53:55,564 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:53:55,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 05:53:55,595 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 23 treesize of output 11 [2022-07-20 05:53:55,645 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:53:55,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:53:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [592045918] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:53:55,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:53:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2022-07-20 05:53:55,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118211952] [2022-07-20 05:53:55,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:53:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 05:53:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 05:53:55,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=524, Unknown=19, NotChecked=144, Total=756 [2022-07-20 05:53:55,896 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:57,007 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-07-20 05:53:57,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:53:57,008 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 32 [2022-07-20 05:53:57,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:57,008 INFO L225 Difference]: With dead ends: 91 [2022-07-20 05:53:57,008 INFO L226 Difference]: Without dead ends: 91 [2022-07-20 05:53:57,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=180, Invalid=1212, Unknown=26, NotChecked=222, Total=1640 [2022-07-20 05:53:57,009 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 75 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 168 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:57,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 412 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 410 Invalid, 0 Unknown, 168 Unchecked, 0.5s Time] [2022-07-20 05:53:57,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-20 05:53:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2022-07-20 05:53:57,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 71 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:53:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-07-20 05:53:57,014 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 32 [2022-07-20 05:53:57,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:57,014 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-07-20 05:53:57,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 18 states have internal predecessors, (44), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-20 05:53:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-07-20 05:53:57,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:53:57,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:57,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:57,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-20 05:53:57,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Forceful destruction successful, exit code 0 [2022-07-20 05:53:57,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 05:53:57,420 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:57,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:57,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1548295403, now seen corresponding path program 1 times [2022-07-20 05:53:57,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:57,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135275527] [2022-07-20 05:53:57,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:57,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:57,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:57,422 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-20 05:53:57,423 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-20 05:53:57,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:57,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 05:53:57,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:57,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-07-20 05:53:57,524 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-20 05:53:57,524 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:53:57,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:53:57,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135275527] [2022-07-20 05:53:57,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135275527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:53:57,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:53:57,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:53:57,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924941626] [2022-07-20 05:53:57,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:53:57,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:53:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:53:57,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:53:57,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:53:57,525 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:57,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:53:57,682 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-07-20 05:53:57,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:53:57,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-07-20 05:53:57,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:53:57,683 INFO L225 Difference]: With dead ends: 83 [2022-07-20 05:53:57,683 INFO L226 Difference]: Without dead ends: 83 [2022-07-20 05:53:57,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:53:57,684 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:53:57,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:53:57,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-20 05:53:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-07-20 05:53:57,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 72 states have internal predecessors, (78), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:53:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2022-07-20 05:53:57,686 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 33 [2022-07-20 05:53:57,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:53:57,686 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2022-07-20 05:53:57,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-20 05:53:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2022-07-20 05:53:57,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:53:57,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:53:57,687 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:53:57,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-20 05:53:57,896 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-20 05:53:57,896 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:53:57,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:53:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1617154909, now seen corresponding path program 1 times [2022-07-20 05:53:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:53:57,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1980668588] [2022-07-20 05:53:57,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:53:57,897 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:53:57,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:53:57,898 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-20 05:53:57,900 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-20 05:53:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:53:58,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 05:53:58,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:53:58,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:53:58,065 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:53:58,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:53:58,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:54:00,136 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_33| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_22| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_33|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_22|) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_33|))) is different from true [2022-07-20 05:54:00,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:04,264 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-20 05:54:04,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-07-20 05:54:04,268 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 31 treesize of output 33 [2022-07-20 05:54:04,349 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 28 treesize of output 20 [2022-07-20 05:54:04,404 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 05:54:04,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-20 05:54:04,530 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 05:54:04,530 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 15 treesize of output 20 [2022-07-20 05:54:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-07-20 05:54:04,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:54:05,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 77 [2022-07-20 05:54:05,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_entry_point_#t~ret48#1.base_47| (_ BitVec 32)) (v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32)))) (= |v_ULTIMATE.start_entry_point_#t~ret48#1.base_47| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_47|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_549) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) is different from false [2022-07-20 05:54:05,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:54:05,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1980668588] [2022-07-20 05:54:05,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1980668588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:54:05,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [172871467] [2022-07-20 05:54:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:54:05,228 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:54:05,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:54:05,229 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:54:05,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Waiting until timeout for monitored process [2022-07-20 05:54:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:54:05,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 05:54:05,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:54:05,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:07,614 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:54:07,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:54:07,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:54:07,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:54:09,769 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_35| (_ BitVec 32))) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_35|) (_ bv0 32)) |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_35|))) is different from true [2022-07-20 05:54:09,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:17,956 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-20 05:54:17,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2022-07-20 05:54:17,960 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 31 treesize of output 33 [2022-07-20 05:54:18,097 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 28 treesize of output 20 [2022-07-20 05:54:18,189 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 05:54:18,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 19 [2022-07-20 05:54:20,310 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:54:20,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 28 [2022-07-20 05:54:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-07-20 05:54:20,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:54:24,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 77 [2022-07-20 05:54:24,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_entry_point_#t~ret48#1.base_50| (_ BitVec 32))) (= |v_ULTIMATE.start_entry_point_#t~ret48#1.base_50| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base|) |c_ULTIMATE.start_entry_point_#t~mem47#1.offset| |v_ULTIMATE.start_entry_point_#t~ret48#1.base_50|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_549) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|)))) is different from false [2022-07-20 05:54:24,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [172871467] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:54:24,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:54:24,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 30 [2022-07-20 05:54:24,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004322508] [2022-07-20 05:54:24,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:54:24,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:54:24,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:54:24,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:54:24,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1008, Unknown=21, NotChecked=268, Total=1406 [2022-07-20 05:54:24,751 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-20 05:54:43,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:54:43,901 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-07-20 05:54:43,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:54:43,902 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2022-07-20 05:54:43,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:54:43,903 INFO L225 Difference]: With dead ends: 96 [2022-07-20 05:54:43,903 INFO L226 Difference]: Without dead ends: 96 [2022-07-20 05:54:43,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 10 SemanticMatches, 46 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=210, Invalid=1673, Unknown=25, NotChecked=348, Total=2256 [2022-07-20 05:54:43,904 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 80 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:54:43,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 512 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 608 Invalid, 0 Unknown, 332 Unchecked, 0.6s Time] [2022-07-20 05:54:43,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-20 05:54:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 88. [2022-07-20 05:54:43,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 75 states have internal predecessors, (84), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 05:54:43,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2022-07-20 05:54:43,907 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 37 [2022-07-20 05:54:43,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:54:43,907 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2022-07-20 05:54:43,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 1.75) internal successors, (49), 25 states have internal predecessors, (49), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2022-07-20 05:54:43,907 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2022-07-20 05:54:43,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:54:43,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:54:43,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:54:43,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (34)] Forceful destruction successful, exit code 0 [2022-07-20 05:54:44,118 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-20 05:54:44,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:54:44,311 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:54:44,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:54:44,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1617154908, now seen corresponding path program 1 times [2022-07-20 05:54:44,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:54:44,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736348395] [2022-07-20 05:54:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:54:44,312 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:54:44,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:54:44,313 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-20 05:54:44,314 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-20 05:54:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:54:44,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 05:54:44,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:54:44,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:44,487 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:54:44,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:54:44,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:54:44,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:46,561 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_25| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_37|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_25|)))) is different from true [2022-07-20 05:54:48,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:48,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:50,776 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-20 05:54:50,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-20 05:54:50,780 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2022-07-20 05:54:50,977 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 05:54:50,977 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-07-20 05:54:50,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-20 05:54:51,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:54:51,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:54:51,175 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:54:51,175 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 15 treesize of output 15 [2022-07-20 05:54:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:54:51,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:54:54,256 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:54:54,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736348395] [2022-07-20 05:54:54,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736348395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:54:54,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [322907359] [2022-07-20 05:54:54,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:54:54,257 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:54:54,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:54:54,258 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:54:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-20 05:54:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:54:54,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 05:54:54,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:54:54,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:54,617 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:54:54,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:54:54,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:54:54,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:54:57,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:57,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:54:57,320 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 05:54:57,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-20 05:54:57,324 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 54 [2022-07-20 05:54:57,667 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:54:57,667 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 46 [2022-07-20 05:54:57,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-20 05:54:59,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:54:59,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:54:59,777 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:54:59,777 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 15 treesize of output 15 [2022-07-20 05:54:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:54:59,785 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:55:04,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [322907359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:55:04,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:55:04,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 34 [2022-07-20 05:55:04,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588902379] [2022-07-20 05:55:04,043 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:55:04,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 05:55:04,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:55:04,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 05:55:04,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1148, Unknown=3, NotChecked=68, Total=1332 [2022-07-20 05:55:04,044 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 26 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:55:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:55:13,234 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-20 05:55:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:55:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 26 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Word has length 37 [2022-07-20 05:55:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:55:13,236 INFO L225 Difference]: With dead ends: 90 [2022-07-20 05:55:13,236 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 05:55:13,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=221, Invalid=1939, Unknown=6, NotChecked=90, Total=2256 [2022-07-20 05:55:13,237 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 57 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 265 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:55:13,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 544 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 423 Invalid, 0 Unknown, 265 Unchecked, 0.5s Time] [2022-07-20 05:55:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 05:55:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2022-07-20 05:55:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 75 states have internal predecessors, (82), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 05:55:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-07-20 05:55:13,239 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 37 [2022-07-20 05:55:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:55:13,239 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-07-20 05:55:13,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 26 states have internal predecessors, (50), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-07-20 05:55:13,240 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-07-20 05:55:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 05:55:13,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:55:13,240 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-20 05:55:13,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-20 05:55:13,452 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-20 05:55:13,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 05:55:13,645 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:55:13,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:55:13,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1614444768, now seen corresponding path program 1 times [2022-07-20 05:55:13,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:55:13,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031501613] [2022-07-20 05:55:13,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:55:13,646 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:55:13,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:55:13,647 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-20 05:55:13,649 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-20 05:55:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:55:13,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 05:55:13,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:55:13,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:55:13,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:55:14,133 INFO L356 Elim1Store]: treesize reduction 3, result has 81.3 percent of original size [2022-07-20 05:55:14,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-07-20 05:55:14,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-20 05:55:14,256 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-20 05:55:14,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2022-07-20 05:55:14,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:55:14,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:55:14,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:55:14,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2022-07-20 05:55:14,552 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 24 treesize of output 16 [2022-07-20 05:55:14,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:55:14,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031501613] [2022-07-20 05:55:14,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031501613] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:55:14,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1829358842] [2022-07-20 05:55:14,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:55:14,710 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:55:14,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:55:14,711 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:55:14,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process [2022-07-20 05:55:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:55:14,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 05:55:14,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:55:14,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:55:14,941 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:55:14,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:55:14,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:55:15,060 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 5 treesize of output 3 [2022-07-20 05:55:19,201 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:55:19,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 05:55:19,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:55:19,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 05:55:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:55:19,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:55:19,440 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 1) (select |c_#valid| |c_ULTIMATE.start_entry_point_~a10~0#1.base|)) (forall ((v_ArrVal_696 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_696) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) |c_ULTIMATE.start_entry_point_~a10~0#1.base|)))) is different from false [2022-07-20 05:55:19,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1829358842] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:55:19,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:55:19,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2022-07-20 05:55:19,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891330218] [2022-07-20 05:55:19,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:55:19,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-20 05:55:19,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:55:19,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-20 05:55:19,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=805, Unknown=2, NotChecked=58, Total=992 [2022-07-20 05:55:19,458 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 25 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 05:55:30,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:55:30,907 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2022-07-20 05:55:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 05:55:30,907 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2022-07-20 05:55:30,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:55:30,908 INFO L225 Difference]: With dead ends: 129 [2022-07-20 05:55:30,908 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 05:55:30,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=306, Invalid=1854, Unknown=6, NotChecked=90, Total=2256 [2022-07-20 05:55:30,909 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:55:30,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 545 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 742 Invalid, 0 Unknown, 142 Unchecked, 0.9s Time] [2022-07-20 05:55:30,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 05:55:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2022-07-20 05:55:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 83 states have internal predecessors, (90), 5 states have call successors, (5), 5 states have call predecessors, (5), 7 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2022-07-20 05:55:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2022-07-20 05:55:30,911 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 36 [2022-07-20 05:55:30,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:55:30,912 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2022-07-20 05:55:30,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.375) internal successors, (57), 22 states have internal predecessors, (57), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-20 05:55:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2022-07-20 05:55:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:55:30,912 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:55:30,912 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:55:30,929 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-20 05:55:31,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Ended with exit code 0 [2022-07-20 05:55:31,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 05:55:31,320 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:55:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:55:31,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2127689086, now seen corresponding path program 1 times [2022-07-20 05:55:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:55:31,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264271584] [2022-07-20 05:55:31,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:55:31,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:55:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:55:31,322 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-20 05:55:31,323 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-20 05:55:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:55:31,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 05:55:31,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:55:31,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:55:31,476 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:55:31,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-20 05:55:31,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:55:33,545 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_31| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_44| (_ BitVec 32))) (not (= |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_44| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_entry_point_~a10~0#1.base_BEFORE_CALL_44|) |v_ULTIMATE.start_entry_point_~a10~0#1.offset_BEFORE_CALL_31|)))) is different from true [2022-07-20 05:55:35,706 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-20 05:55:35,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-20 05:55:35,711 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-07-20 05:55:35,863 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 05:55:35,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-20 05:55:35,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-20 05:55:35,913 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:55:35,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:55:41,244 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 140 treesize of output 112 [2022-07-20 05:55:41,339 INFO L356 Elim1Store]: treesize reduction 14, result has 54.8 percent of original size [2022-07-20 05:55:41,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 190 [2022-07-20 05:56:05,072 WARN L233 SmtUtils]: Spent 20.06s on a formula simplification. DAG size of input: 39 DAG size of output: 19 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:56:05,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:56:05,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-20 05:56:05,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:56:05,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264271584] [2022-07-20 05:56:05,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264271584] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:56:05,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:56:05,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 23 [2022-07-20 05:56:05,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129393724] [2022-07-20 05:56:05,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:56:05,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-20 05:56:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:56:05,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-20 05:56:05,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=405, Unknown=3, NotChecked=40, Total=506 [2022-07-20 05:56:05,228 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 05:56:06,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:56:06,240 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2022-07-20 05:56:06,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:56:06,240 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 37 [2022-07-20 05:56:06,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:56:06,241 INFO L225 Difference]: With dead ends: 89 [2022-07-20 05:56:06,241 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 05:56:06,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 33.4s TimeCoverageRelationStatistics Valid=109, Invalid=704, Unknown=3, NotChecked=54, Total=870 [2022-07-20 05:56:06,242 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 42 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:56:06,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 461 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 399 Invalid, 0 Unknown, 298 Unchecked, 0.7s Time] [2022-07-20 05:56:06,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 05:56:06,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2022-07-20 05:56:06,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 4 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-20 05:56:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2022-07-20 05:56:06,244 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 37 [2022-07-20 05:56:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:56:06,244 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2022-07-20 05:56:06,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 19 states have internal predecessors, (44), 5 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-20 05:56:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2022-07-20 05:56:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:56:06,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:56:06,245 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-07-20 05:56:06,252 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-20 05:56:06,445 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-20 05:56:06,445 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-07-20 05:56:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:56:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash -998224317, now seen corresponding path program 1 times [2022-07-20 05:56:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 05:56:06,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [563660442] [2022-07-20 05:56:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:56:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 05:56:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 05:56:06,447 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-20 05:56:06,448 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-20 05:56:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:56:06,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 05:56:06,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:56:06,791 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:56:06,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:56:06,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:56:07,059 INFO L356 Elim1Store]: treesize reduction 6, result has 50.0 percent of original size [2022-07-20 05:56:07,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2022-07-20 05:56:07,337 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-20 05:56:07,337 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 44 [2022-07-20 05:56:07,846 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:56:07,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 41 [2022-07-20 05:56:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-20 05:56:18,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:56:18,674 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 23 [2022-07-20 05:56:52,186 WARN L233 SmtUtils]: Spent 10.66s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 05:56:52,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 05:56:52,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [563660442] [2022-07-20 05:56:52,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [563660442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:56:52,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2130912532] [2022-07-20 05:56:52,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:56:52,187 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 05:56:52,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 05:56:52,189 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 05:56:52,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (41)] Waiting until timeout for monitored process [2022-07-20 05:56:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:56:52,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 05:56:52,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:56:52,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:56:52,969 INFO L356 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-07-20 05:56:52,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 20 [2022-07-20 05:57:03,221 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:57:03,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-20 05:57:03,383 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 34 treesize of output 22 [2022-07-20 05:57:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 05:57:10,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:57:11,009 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_entry_point_#t~mem47#1.base| v_ArrVal_778) |c_ULTIMATE.start_entry_point_~a10~0#1.base|) |c_ULTIMATE.start_entry_point_~a10~0#1.offset|) (_ bv0 1)) |c_ULTIMATE.start_entry_point_~a10~0#1.base| (_ bv0 1)))) is different from false [2022-07-20 05:57:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2130912532] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:57:11,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 05:57:11,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2022-07-20 05:57:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368701683] [2022-07-20 05:57:11,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 05:57:11,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:57:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 05:57:11,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:57:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1697, Unknown=21, NotChecked=84, Total=1980 [2022-07-20 05:57:11,029 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand has 31 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 25 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)